./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:26:39,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:26:39,456 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:26:39,461 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:26:39,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:26:39,498 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:26:39,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:26:39,500 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:26:39,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:26:39,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:26:39,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:26:39,504 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:26:39,504 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:26:39,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:26:39,505 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:26:39,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:26:39,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:26:39,506 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:26:39,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:26:39,511 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:26:39,511 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:26:39,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:26:39,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:26:39,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:26:39,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:26:39,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:26:39,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:26:39,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:26:39,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:26:39,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:26:39,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:26:39,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:26:39,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:26:39,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:26:39,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:26:39,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:26:39,517 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:26:39,517 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:26:39,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:26:39,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:26:39,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:26:39,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:26:39,529 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-10-11 09:26:39,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:26:39,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:26:39,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:26:39,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:26:39,799 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:26:39,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:26:41,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:26:41,489 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:26:41,489 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:26:41,501 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf2759ed8/915a054927914c1898f069f88c747d03/FLAG42113ea78 [2024-10-11 09:26:41,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cf2759ed8/915a054927914c1898f069f88c747d03 [2024-10-11 09:26:41,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:26:41,518 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:26:41,519 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:26:41,519 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:26:41,525 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:26:41,526 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:41,527 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7deae88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41, skipping insertion in model container [2024-10-11 09:26:41,527 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:41,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:26:41,727 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-11 09:26:41,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:26:41,856 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:26:41,871 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-11 09:26:41,918 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:26:41,946 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:26:41,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41 WrapperNode [2024-10-11 09:26:41,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:26:41,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:26:41,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:26:41,949 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:26:41,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:41,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,036 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-11 09:26:42,036 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:26:42,038 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:26:42,038 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:26:42,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:26:42,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,052 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,091 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:26:42,092 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,092 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:26:42,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:26:42,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:26:42,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:26:42,129 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (1/1) ... [2024-10-11 09:26:42,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:26:42,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:26:42,169 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:26:42,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:26:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:26:42,223 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:26:42,224 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:26:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:26:42,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:26:42,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:26:42,334 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:26:42,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:26:42,765 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:26:42,765 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:26:42,807 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:26:42,808 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:26:42,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:26:42 BoogieIcfgContainer [2024-10-11 09:26:42,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:26:42,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:26:42,812 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:26:42,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:26:42,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:26:41" (1/3) ... [2024-10-11 09:26:42,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510b16ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:26:42, skipping insertion in model container [2024-10-11 09:26:42,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:41" (2/3) ... [2024-10-11 09:26:42,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@510b16ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:26:42, skipping insertion in model container [2024-10-11 09:26:42,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:26:42" (3/3) ... [2024-10-11 09:26:42,819 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:26:42,835 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:26:42,836 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:26:42,898 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:26:42,904 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@37bc0723, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:26:42,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:26:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 09:26:42,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 09:26:42,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:42,921 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:42,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:42,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1742159795, now seen corresponding path program 1 times [2024-10-11 09:26:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:42,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760145607] [2024-10-11 09:26:42,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:42,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:26:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:26:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 09:26:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:26:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:26:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:26:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:26:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:26:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:26:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:26:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:26:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:26:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:26:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:26:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:26:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:26:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:26:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:26:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:26:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:26:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:26:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:26:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:26:43,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:26:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:26:43,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:26:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 09:26:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:26:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:43,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:26:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:26:43,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760145607] [2024-10-11 09:26:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760145607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:26:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:26:43,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:26:43,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915277638] [2024-10-11 09:26:43,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:26:43,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:26:43,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:26:43,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:26:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:26:43,649 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:43,702 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-11 09:26:43,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:26:43,705 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-11 09:26:43,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:43,719 INFO L225 Difference]: With dead ends: 161 [2024-10-11 09:26:43,719 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 09:26:43,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:26:43,730 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:43,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:26:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 09:26:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 09:26:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 09:26:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-11 09:26:43,776 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-11 09:26:43,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:43,779 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-11 09:26:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-11 09:26:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 09:26:43,783 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:43,784 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:43,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:26:43,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:43,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:43,785 INFO L85 PathProgramCache]: Analyzing trace with hash -2135186805, now seen corresponding path program 1 times [2024-10-11 09:26:43,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:43,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551051905] [2024-10-11 09:26:43,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:43,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:26:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:26:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 09:26:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:26:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:26:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:26:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:26:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:26:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:26:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:26:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:26:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:26:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:26:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:26:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:26:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:26:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:26:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:26:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:26:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:26:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:26:44,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:26:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:26:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:26:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:26:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:26:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 09:26:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:26:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:26:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:26:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551051905] [2024-10-11 09:26:44,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551051905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:26:44,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:26:44,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:26:44,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185082064] [2024-10-11 09:26:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:26:44,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:26:44,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:26:44,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:26:44,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:26:44,716 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 09:26:44,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:44,906 INFO L93 Difference]: Finished difference Result 238 states and 382 transitions. [2024-10-11 09:26:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:26:44,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2024-10-11 09:26:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:44,911 INFO L225 Difference]: With dead ends: 238 [2024-10-11 09:26:44,911 INFO L226 Difference]: Without dead ends: 159 [2024-10-11 09:26:44,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:26:44,913 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 137 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:44,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 233 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:26:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-11 09:26:44,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2024-10-11 09:26:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 97 states have internal predecessors, (139), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 09:26:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 251 transitions. [2024-10-11 09:26:44,956 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 251 transitions. Word has length 176 [2024-10-11 09:26:44,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:44,957 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 251 transitions. [2024-10-11 09:26:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 09:26:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 251 transitions. [2024-10-11 09:26:44,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 09:26:44,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:44,964 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:44,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:26:44,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:44,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1020699164, now seen corresponding path program 1 times [2024-10-11 09:26:44,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:44,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644031228] [2024-10-11 09:26:44,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:44,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:26:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:26:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 09:26:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:26:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:26:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:26:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:26:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:26:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:26:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:26:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:26:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:26:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:26:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:26:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:26:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:26:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:26:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:26:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:26:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:26:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:26:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:26:45,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:26:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:26:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:26:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 09:26:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:26:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:26:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:26:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644031228] [2024-10-11 09:26:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644031228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:26:45,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:26:45,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:26:45,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617744211] [2024-10-11 09:26:45,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:26:45,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:26:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:26:45,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:26:45,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:26:45,410 INFO L87 Difference]: Start difference. First operand 156 states and 251 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:45,567 INFO L93 Difference]: Finished difference Result 377 states and 603 transitions. [2024-10-11 09:26:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:26:45,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2024-10-11 09:26:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:45,570 INFO L225 Difference]: With dead ends: 377 [2024-10-11 09:26:45,570 INFO L226 Difference]: Without dead ends: 222 [2024-10-11 09:26:45,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:26:45,576 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:45,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 275 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 09:26:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-11 09:26:45,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 213. [2024-10-11 09:26:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.4383561643835616) internal successors, (210), 148 states have internal predecessors, (210), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 09:26:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 334 transitions. [2024-10-11 09:26:45,632 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 334 transitions. Word has length 177 [2024-10-11 09:26:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:45,633 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 334 transitions. [2024-10-11 09:26:45,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 334 transitions. [2024-10-11 09:26:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 09:26:45,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:45,639 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:26:45,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:45,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash 334817835, now seen corresponding path program 1 times [2024-10-11 09:26:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:45,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591225947] [2024-10-11 09:26:45,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:26:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:45,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:26:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 09:26:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:26:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:26:46,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:26:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:26:46,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:26:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:26:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:26:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:26:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:26:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:26:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:26:46,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:26:46,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:26:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:26:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:26:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:26:46,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:26:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:26:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:26:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:26:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:26:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:26:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:26:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 09:26:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:26:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:26:46,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:26:46,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591225947] [2024-10-11 09:26:46,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591225947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:26:46,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:26:46,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:26:46,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443763720] [2024-10-11 09:26:46,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:26:46,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:26:46,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:26:46,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:26:46,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:26:46,158 INFO L87 Difference]: Start difference. First operand 213 states and 334 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:46,436 INFO L93 Difference]: Finished difference Result 376 states and 587 transitions. [2024-10-11 09:26:46,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:26:46,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-11 09:26:46,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:46,442 INFO L225 Difference]: With dead ends: 376 [2024-10-11 09:26:46,442 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 09:26:46,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:26:46,444 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 154 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:46,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 441 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:26:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 09:26:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 220. [2024-10-11 09:26:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 153 states have (on average 1.4313725490196079) internal successors, (219), 155 states have internal predecessors, (219), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 09:26:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 343 transitions. [2024-10-11 09:26:46,502 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 343 transitions. Word has length 178 [2024-10-11 09:26:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:46,504 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 343 transitions. [2024-10-11 09:26:46,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:26:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 343 transitions. [2024-10-11 09:26:46,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-11 09:26:46,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:46,508 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:46,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:26:46,509 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -945045843, now seen corresponding path program 1 times [2024-10-11 09:26:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20068010] [2024-10-11 09:26:46,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:26:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:26:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 09:26:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:26:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 09:26:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:26:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 09:26:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:26:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:26:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:26:46,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:26:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:26:46,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:26:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:26:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 09:26:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:26:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 09:26:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:26:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:26:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:26:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 09:26:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:26:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 09:26:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 09:26:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 09:26:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 09:26:46,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 09:26:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 09:26:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 09:26:46,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:26:46,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20068010] [2024-10-11 09:26:46,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20068010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:26:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790754170] [2024-10-11 09:26:46,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:26:46,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:26:46,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:26:46,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:26:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:47,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:26:47,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:26:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-10-11 09:26:47,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:26:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 09:26:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790754170] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 09:26:47,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 09:26:47,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 09:26:47,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372998202] [2024-10-11 09:26:47,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 09:26:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 09:26:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:26:47,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 09:26:47,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:26:47,463 INFO L87 Difference]: Start difference. First operand 220 states and 343 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:26:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:47,912 INFO L93 Difference]: Finished difference Result 491 states and 759 transitions. [2024-10-11 09:26:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 09:26:47,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 178 [2024-10-11 09:26:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:47,917 INFO L225 Difference]: With dead ends: 491 [2024-10-11 09:26:47,918 INFO L226 Difference]: Without dead ends: 272 [2024-10-11 09:26:47,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 09:26:47,921 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 83 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:47,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 317 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:26:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-11 09:26:47,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-10-11 09:26:47,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.3662790697674418) internal successors, (235), 175 states have internal predecessors, (235), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-10-11 09:26:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 407 transitions. [2024-10-11 09:26:47,973 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 407 transitions. Word has length 178 [2024-10-11 09:26:47,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:47,974 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 407 transitions. [2024-10-11 09:26:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-11 09:26:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 407 transitions. [2024-10-11 09:26:47,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 09:26:47,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:47,977 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:26:47,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:26:48,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:26:48,182 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:48,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1936698910, now seen corresponding path program 1 times [2024-10-11 09:26:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:26:48,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810848792] [2024-10-11 09:26:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:26:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:26:48,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778540801] [2024-10-11 09:26:48,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:48,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:26:48,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:26:48,280 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:26:48,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:26:48,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:26:48,431 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:26:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:26:48,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:26:48,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:26:48,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:26:48,730 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:26:48,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:26:48,911 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:26:49,050 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:26:49,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:26:49 BoogieIcfgContainer [2024-10-11 09:26:49,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:26:49,054 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:26:49,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:26:49,054 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:26:49,055 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:26:42" (3/4) ... [2024-10-11 09:26:49,057 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:26:49,058 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:26:49,058 INFO L158 Benchmark]: Toolchain (without parser) took 7540.62ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 124.5MB in the beginning and 234.6MB in the end (delta: -110.1MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-10-11 09:26:49,059 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:26:49,059 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.20ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 106.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:26:49,059 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.38ms. Allocated memory is still 182.5MB. Free memory was 106.9MB in the beginning and 102.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:26:49,059 INFO L158 Benchmark]: Boogie Preprocessor took 89.46ms. Allocated memory is still 182.5MB. Free memory was 102.3MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:26:49,060 INFO L158 Benchmark]: RCFGBuilder took 680.89ms. Allocated memory is still 182.5MB. Free memory was 96.0MB in the beginning and 65.4MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 09:26:49,060 INFO L158 Benchmark]: TraceAbstraction took 6241.93ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 64.5MB in the beginning and 234.6MB in the end (delta: -170.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:26:49,060 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 306.2MB. Free memory is still 234.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:26:49,061 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.20ms. Allocated memory is still 182.5MB. Free memory was 124.1MB in the beginning and 106.9MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.38ms. Allocated memory is still 182.5MB. Free memory was 106.9MB in the beginning and 102.3MB in the end (delta: 4.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.46ms. Allocated memory is still 182.5MB. Free memory was 102.3MB in the beginning and 96.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 680.89ms. Allocated memory is still 182.5MB. Free memory was 96.0MB in the beginning and 65.4MB in the end (delta: 30.6MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6241.93ms. Allocated memory was 182.5MB in the beginning and 306.2MB in the end (delta: 123.7MB). Free memory was 64.5MB in the beginning and 234.6MB in the end (delta: -170.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 306.2MB. Free memory is still 234.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 205. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned short int var_1_27 = 64; [L39] float var_1_33 = 2.5; [L40] unsigned long int var_1_35 = 10; [L41] unsigned long int var_1_37 = 2924974040; [L42] unsigned char var_1_38 = 1; [L43] unsigned char var_1_39 = 0; [L44] unsigned char var_1_40 = 0; [L45] unsigned char var_1_41 = 0; [L46] unsigned char var_1_44 = 0; [L47] unsigned char var_1_45 = 0; [L48] unsigned long int var_1_46 = 32; [L49] unsigned long int var_1_47 = 1000000000; [L50] unsigned long int last_1_var_1_1 = 16; [L51] signed char last_1_var_1_9 = 10; [L52] unsigned short int last_1_var_1_12 = 10000; [L53] double last_1_var_1_20 = 1.5; [L54] unsigned char last_1_var_1_22 = 5; [L55] signed short int last_1_var_1_25 = 10; [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L197] last_1_var_1_1 = var_1_1 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_12 = var_1_12 [L200] last_1_var_1_20 = var_1_20 [L201] last_1_var_1_22 = var_1_22 [L202] last_1_var_1_25 = var_1_25 [L212] RET updateLastVariables() [L213] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L153] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L154] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L155] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L158] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L163] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L165] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L166] var_1_18 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L168] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L170] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L171] var_1_23 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L172] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L173] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L173] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L174] var_1_24 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L176] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L176] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L177] var_1_26 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L178] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L179] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L179] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L180] var_1_37 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L181] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L182] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L182] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L183] var_1_39 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L184] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L185] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L185] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L186] var_1_40 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L188] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L188] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L189] var_1_44 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_44 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L190] RET assume_abort_if_not(var_1_44 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L191] CALL assume_abort_if_not(var_1_44 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L191] RET assume_abort_if_not(var_1_44 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L192] var_1_45 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L193] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L194] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L194] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=10] [L213] RET updateVariables() [L214] CALL step() [L59] COND FALSE !(! var_1_10) [L66] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L68] COND TRUE var_1_11 < (var_1_12 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L69] COND TRUE \read(var_1_10) [L70] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L73] COND TRUE var_1_13 >= (- 255.45f) [L74] var_1_38 = ((! var_1_39) && var_1_40) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L80] unsigned char stepLocal_2 = var_1_10; [L81] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L82] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=1, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L83] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L86] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L89] COND TRUE \read(var_1_44) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=1000000000, var_1_4=2, var_1_9=1] [L90] COND FALSE !(\read(var_1_45)) [L95] var_1_47 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L98] unsigned long int stepLocal_5 = last_1_var_1_1; [L99] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L100] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, stepLocal_5=16, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L101] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L112] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L114] COND TRUE var_1_11 > (var_1_22 * (var_1_12 + var_1_22)) [L115] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L117] COND FALSE !(var_1_12 < var_1_12) [L120] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=10, var_1_27=0, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L122] COND FALSE !((var_1_20 / var_1_26) > var_1_13) [L125] var_1_25 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L127] COND TRUE \read(var_1_10) [L128] var_1_35 = ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L136] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=1, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L137] COND TRUE stepLocal_0 == var_1_25 [L138] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L140] COND TRUE ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < (var_1_9 % var_1_4) [L141] var_1_41 = ((! (var_1_40 && var_1_44)) || (var_1_39 && var_1_45)) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=32, var_1_47=0, var_1_4=2, var_1_9=1] [L145] COND TRUE \read(var_1_10) [L146] var_1_46 = (var_1_24 + ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=12, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=1, var_1_12=5, var_1_18=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=0, var_1_23=32767, var_1_24=0, var_1_25=1, var_1_27=0, var_1_33=2, var_1_35=32767, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=1, var_1_41=0, var_1_44=257, var_1_45=256, var_1_46=0, var_1_47=0, var_1_4=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.0s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 421 mSDsluCounter, 1391 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 749 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 484 IncrementalHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 642 mSDtfsCounter, 484 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 662 GetRequests, 642 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 63 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1421 NumberOfCodeBlocks, 1421 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1234 ConstructedInterpolants, 0 QuantifiedInterpolants, 2785 SizeOfPredicates, 2 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10557/10584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:26:49,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:26:51,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:26:51,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:26:51,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:26:51,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:26:51,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:26:51,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:26:51,600 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:26:51,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:26:51,601 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:26:51,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:26:51,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:26:51,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:26:51,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:26:51,606 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:26:51,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:26:51,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:26:51,607 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:26:51,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:26:51,607 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:26:51,608 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:26:51,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:26:51,613 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:26:51,613 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:26:51,613 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:26:51,613 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:26:51,613 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:26:51,614 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:26:51,614 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:26:51,614 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:26:51,614 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:26:51,615 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:26:51,615 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:26:51,616 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:26:51,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:26:51,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:26:51,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:26:51,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:26:51,627 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:26:51,627 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:26:51,627 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:26:51,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:26:51,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:26:51,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:26:51,629 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:26:51,629 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-10-11 09:26:52,000 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:26:52,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:26:52,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:26:52,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:26:52,038 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:26:52,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:26:53,729 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:26:53,981 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:26:53,982 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:26:53,997 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f56c8835b/53956a42cba14ee09f042d8d953fd965/FLAG678c5074f [2024-10-11 09:26:54,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/f56c8835b/53956a42cba14ee09f042d8d953fd965 [2024-10-11 09:26:54,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:26:54,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:26:54,022 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:26:54,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:26:54,028 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:26:54,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7653e883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54, skipping insertion in model container [2024-10-11 09:26:54,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:26:54,265 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-11 09:26:54,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:26:54,411 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:26:54,426 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i[919,932] [2024-10-11 09:26:54,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:26:54,510 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:26:54,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54 WrapperNode [2024-10-11 09:26:54,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:26:54,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:26:54,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:26:54,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:26:54,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,578 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-11 09:26:54,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:26:54,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:26:54,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:26:54,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:26:54,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:26:54,627 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,644 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:26:54,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:26:54,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:26:54,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:26:54,670 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (1/1) ... [2024-10-11 09:26:54,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:26:54,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:26:54,707 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:26:54,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:26:54,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:26:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:26:54,758 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:26:54,758 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:26:54,760 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:26:54,760 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:26:54,875 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:26:54,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:27:08,608 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-11 09:27:08,609 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:27:08,655 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:27:08,655 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:27:08,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:08 BoogieIcfgContainer [2024-10-11 09:27:08,666 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:27:08,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:27:08,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:27:08,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:27:08,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:26:54" (1/3) ... [2024-10-11 09:27:08,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e67939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:08, skipping insertion in model container [2024-10-11 09:27:08,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:26:54" (2/3) ... [2024-10-11 09:27:08,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e67939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:08, skipping insertion in model container [2024-10-11 09:27:08,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:08" (3/3) ... [2024-10-11 09:27:08,678 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-10-11 09:27:08,697 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:27:08,698 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:27:08,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:27:08,790 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1c8493da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:27:08,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:27:08,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 09:27:08,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 09:27:08,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:08,812 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:08,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:08,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1742159795, now seen corresponding path program 1 times [2024-10-11 09:27:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:08,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101704819] [2024-10-11 09:27:08,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:08,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:08,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:08,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:08,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 09:27:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:09,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:27:09,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:27:09,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:27:09,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:09,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101704819] [2024-10-11 09:27:09,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101704819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:09,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:09,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:27:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887924784] [2024-10-11 09:27:09,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:09,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:27:09,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:09,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:27:09,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:09,971 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.5490196078431373) internal successors, (79), 52 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:27:14,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:14,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:14,325 INFO L93 Difference]: Finished difference Result 161 states and 296 transitions. [2024-10-11 09:27:14,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:27:14,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-11 09:27:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:14,438 INFO L225 Difference]: With dead ends: 161 [2024-10-11 09:27:14,439 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 09:27:14,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:14,445 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:14,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 09:27:14,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 09:27:14,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 09:27:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.44) internal successors, (72), 50 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 09:27:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 128 transitions. [2024-10-11 09:27:14,487 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 128 transitions. Word has length 176 [2024-10-11 09:27:14,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:14,489 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 128 transitions. [2024-10-11 09:27:14,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:27:14,490 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 128 transitions. [2024-10-11 09:27:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 09:27:14,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:14,494 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:14,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 09:27:14,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:14,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -2135186805, now seen corresponding path program 1 times [2024-10-11 09:27:14,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:14,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438359198] [2024-10-11 09:27:14,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:14,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:14,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:14,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:14,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 09:27:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:15,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:27:15,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:20,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-10-11 09:27:20,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:27:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:27:21,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:21,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438359198] [2024-10-11 09:27:21,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438359198] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:27:21,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:27:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-10-11 09:27:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707264524] [2024-10-11 09:27:21,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:21,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:27:21,816 INFO L87 Difference]: Start difference. First operand 80 states and 128 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:27:27,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:31,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:35,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:39,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:39,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:39,176 INFO L93 Difference]: Finished difference Result 194 states and 310 transitions. [2024-10-11 09:27:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:27:39,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2024-10-11 09:27:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:39,180 INFO L225 Difference]: With dead ends: 194 [2024-10-11 09:27:39,180 INFO L226 Difference]: Without dead ends: 115 [2024-10-11 09:27:39,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 09:27:39,187 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 83 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:39,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 240 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 22 Invalid, 4 Unknown, 0 Unchecked, 17.3s Time] [2024-10-11 09:27:39,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-11 09:27:39,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-10-11 09:27:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 78 states have (on average 1.4615384615384615) internal successors, (114), 79 states have internal predecessors, (114), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-11 09:27:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 176 transitions. [2024-10-11 09:27:39,214 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 176 transitions. Word has length 176 [2024-10-11 09:27:39,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:39,215 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 176 transitions. [2024-10-11 09:27:39,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:27:39,215 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 176 transitions. [2024-10-11 09:27:39,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-10-11 09:27:39,218 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:39,218 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:39,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 09:27:39,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:39,420 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:39,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:39,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1286600604, now seen corresponding path program 1 times [2024-10-11 09:27:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:27:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860184789] [2024-10-11 09:27:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 09:27:39,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:27:39,425 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 09:27:39,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 09:27:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:40,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 09:27:40,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:27:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 09:27:44,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:27:44,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:27:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860184789] [2024-10-11 09:27:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860184789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:27:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713338196] [2024-10-11 09:27:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:27:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:27:44,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:27:44,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:27:44,782 INFO L87 Difference]: Start difference. First operand 112 states and 176 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 09:27:51,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:55,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:27:59,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 09:28:03,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 09:28:07,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]