./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_codestructure_steplocals_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:20:12,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:20:12,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:20:12,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:20:12,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:20:12,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:20:12,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:20:12,519 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:20:12,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:20:12,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:20:12,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:20:12,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:20:12,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:20:12,526 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:20:12,526 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:20:12,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:20:12,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:20:12,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:20:12,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:20:12,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:20:12,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:20:12,530 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:20:12,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:20:12,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:20:12,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:20:12,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:20:12,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:20:12,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:20:12,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:20:12,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:20:12,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:20:12,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:20:12,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:20:12,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:20:12,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:20:12,535 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:20:12,535 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:20:12,536 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:20:12,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:20:12,536 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:20:12,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:20:12,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:20:12,537 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/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/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 -> 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 [2024-10-13 00:20:12,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:20:12,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:20:12,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:20:12,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:20:12,853 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:20:12,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:14,375 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:20:14,604 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:20:14,606 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:14,622 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca36de4f/7fd0c00c3d244eada75bb749cda6ac94/FLAGc33ee92ab [2024-10-13 00:20:14,952 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ca36de4f/7fd0c00c3d244eada75bb749cda6ac94 [2024-10-13 00:20:14,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:20:14,956 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:20:14,958 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:20:14,958 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:20:14,964 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:20:14,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:20:14" (1/1) ... [2024-10-13 00:20:14,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70de96a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:14, skipping insertion in model container [2024-10-13 00:20:14,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:20:14" (1/1) ... [2024-10-13 00:20:14,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:20:15,165 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_codestructure_steplocals_file-97.i[917,930] [2024-10-13 00:20:15,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:20:15,244 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:20:15,258 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_codestructure_steplocals_file-97.i[917,930] [2024-10-13 00:20:15,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:20:15,355 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:20:15,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15 WrapperNode [2024-10-13 00:20:15,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:20:15,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:20:15,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:20:15,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:20:15,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,377 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,434 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-13 00:20:15,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:20:15,435 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:20:15,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:20:15,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:20:15,446 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,451 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,479 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-13 00:20:15,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:20:15,534 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:20:15,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:20:15,534 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:20:15,535 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (1/1) ... [2024-10-13 00:20:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:20:15,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:20:15,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:20:15,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:20:15,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:20:15,624 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:20:15,625 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:20:15,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:20:15,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:20:15,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:20:15,732 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:20:15,734 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:20:16,167 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-13 00:20:16,168 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:20:16,203 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:20:16,204 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:20:16,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:20:16 BoogieIcfgContainer [2024-10-13 00:20:16,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:20:16,207 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:20:16,207 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:20:16,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:20:16,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:20:14" (1/3) ... [2024-10-13 00:20:16,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b7d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:20:16, skipping insertion in model container [2024-10-13 00:20:16,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:15" (2/3) ... [2024-10-13 00:20:16,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@107b7d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:20:16, skipping insertion in model container [2024-10-13 00:20:16,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:20:16" (3/3) ... [2024-10-13 00:20:16,214 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:16,232 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:20:16,233 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:20:16,299 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:20:16,305 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;@76e75866, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:20:16,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:20:16,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 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-13 00:20:16,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-13 00:20:16,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:20:16,328 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] [2024-10-13 00:20:16,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:20:16,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:20:16,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1344211636, now seen corresponding path program 1 times [2024-10-13 00:20:16,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:20:16,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300063364] [2024-10-13 00:20:16,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:20:16,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:20:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:20:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:20:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:20:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:20:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:20:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:20:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:20:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:20:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:20:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:20:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:20:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:20:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:20:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:20:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:20:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:20:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:20:16,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:20:16,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:20:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:20:16,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:20:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:20:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:20:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:20:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:20:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:20:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:20:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:20:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:16,786 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-13 00:20:16,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:20:16,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300063364] [2024-10-13 00:20:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300063364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:20:16,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:20:16,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:20:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915265797] [2024-10-13 00:20:16,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:20:16,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:20:16,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:20:16,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:20:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:20:16,829 INFO L87 Difference]: Start difference. First operand has 92 states, 61 states have (on average 1.459016393442623) internal successors, (89), 62 states have internal predecessors, (89), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:20:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:20:16,872 INFO L93 Difference]: Finished difference Result 181 states and 316 transitions. [2024-10-13 00:20:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:20:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 172 [2024-10-13 00:20:16,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:20:16,906 INFO L225 Difference]: With dead ends: 181 [2024-10-13 00:20:16,910 INFO L226 Difference]: Without dead ends: 90 [2024-10-13 00:20:16,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-13 00:20:16,917 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:20:16,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:20:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-13 00:20:17,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-13 00:20:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 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-13 00:20:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2024-10-13 00:20:17,032 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 172 [2024-10-13 00:20:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:20:17,032 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2024-10-13 00:20:17,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:20:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2024-10-13 00:20:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-13 00:20:17,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:20:17,040 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] [2024-10-13 00:20:17,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:20:17,041 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:20:17,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:20:17,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1568864317, now seen corresponding path program 1 times [2024-10-13 00:20:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:20:17,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708482225] [2024-10-13 00:20:17,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:20:17,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:20:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:20:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 00:20:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 00:20:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 00:20:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 00:20:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 00:20:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 00:20:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 00:20:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 00:20:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 00:20:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 00:20:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 00:20:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 00:20:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 00:20:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 00:20:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 00:20:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 00:20:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 00:20:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 00:20:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 00:20:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 00:20:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 00:20:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 00:20:17,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 00:20:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 00:20:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 00:20:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 00:20:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 00:20:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:17,912 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-13 00:20:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:20:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708482225] [2024-10-13 00:20:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708482225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:20:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:20:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 00:20:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541944063] [2024-10-13 00:20:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:20:17,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 00:20:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:20:17,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 00:20:17,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:20:17,917 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-13 00:20:18,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:20:18,036 INFO L93 Difference]: Finished difference Result 180 states and 276 transitions. [2024-10-13 00:20:18,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 00:20:18,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 173 [2024-10-13 00:20:18,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:20:18,041 INFO L225 Difference]: With dead ends: 180 [2024-10-13 00:20:18,041 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 00:20:18,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 00:20:18,044 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 48 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:20:18,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 396 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:20:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 00:20:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-10-13 00:20:18,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.35) internal successors, (81), 60 states have internal predecessors, (81), 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-13 00:20:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 137 transitions. [2024-10-13 00:20:18,065 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 137 transitions. Word has length 173 [2024-10-13 00:20:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:20:18,067 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 137 transitions. [2024-10-13 00:20:18,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-13 00:20:18,068 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 137 transitions. [2024-10-13 00:20:18,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-13 00:20:18,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:20:18,076 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] [2024-10-13 00:20:18,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:20:18,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:20:18,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:20:18,077 INFO L85 PathProgramCache]: Analyzing trace with hash 838914312, now seen corresponding path program 1 times [2024-10-13 00:20:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:20:18,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460490730] [2024-10-13 00:20:18,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:20:18,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:20:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:20:18,135 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:20:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:20:18,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:20:18,314 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:20:18,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:20:18,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:20:18,321 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 00:20:18,464 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:20:18,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:20:18 BoogieIcfgContainer [2024-10-13 00:20:18,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:20:18,470 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:20:18,470 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:20:18,471 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:20:18,471 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:20:16" (3/4) ... [2024-10-13 00:20:18,473 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:20:18,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:20:18,475 INFO L158 Benchmark]: Toolchain (without parser) took 3518.74ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 79.1MB in the beginning and 88.8MB in the end (delta: -9.7MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,478 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 151.0MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:20:18,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.11ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 78.9MB in the beginning and 170.2MB in the end (delta: -91.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,479 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.13ms. Allocated memory is still 199.2MB. Free memory was 170.2MB in the beginning and 165.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,479 INFO L158 Benchmark]: Boogie Preprocessor took 97.60ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 157.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,480 INFO L158 Benchmark]: RCFGBuilder took 670.76ms. Allocated memory is still 199.2MB. Free memory was 157.6MB in the beginning and 126.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,480 INFO L158 Benchmark]: TraceAbstraction took 2263.11ms. Allocated memory is still 199.2MB. Free memory was 125.1MB in the beginning and 89.8MB in the end (delta: 35.3MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,480 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 199.2MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:20:18,486 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 151.0MB. Free memory is still 99.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.11ms. Allocated memory was 151.0MB in the beginning and 199.2MB in the end (delta: 48.2MB). Free memory was 78.9MB in the beginning and 170.2MB in the end (delta: -91.3MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.13ms. Allocated memory is still 199.2MB. Free memory was 170.2MB in the beginning and 165.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.60ms. Allocated memory is still 199.2MB. Free memory was 165.0MB in the beginning and 157.6MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 670.76ms. Allocated memory is still 199.2MB. Free memory was 157.6MB in the beginning and 126.2MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2263.11ms. Allocated memory is still 199.2MB. Free memory was 125.1MB in the beginning and 89.8MB in the end (delta: 35.3MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 199.2MB. Free memory was 89.8MB in the beginning and 88.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 144. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L97] var_1_2 = __VERIFIER_nondet_ushort() [L98] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] var_1_3 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] var_1_4 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L105] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] var_1_6 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L108] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L108] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L109] var_1_7 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L111] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L111] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L112] var_1_9 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L114] var_1_10 = __VERIFIER_nondet_float() [L115] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] var_1_11 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L117] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] var_1_12 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L120] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] var_1_13 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] var_1_14 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L126] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] var_1_18 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L129] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] var_1_19 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L132] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] var_1_21 = __VERIFIER_nondet_long() [L135] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L135] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L136] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L136] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L152] RET updateVariables() [L153] CALL step() [L48] signed long int stepLocal_1 = var_1_2 + var_1_3; [L49] signed long int stepLocal_0 = - var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=2, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L50] COND FALSE !(stepLocal_1 < -200) [L61] var_1_1 = var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L63] EXPR (32 * -25) | var_1_2 VAL [isInitial=1, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L63] signed long int stepLocal_4 = (32 * -25) | var_1_2; [L64] unsigned char stepLocal_3 = var_1_4; [L65] signed long int stepLocal_2 = var_1_3 - (var_1_2 + var_1_6); VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L66] COND TRUE 256 > stepLocal_2 [L67] var_1_5 = var_1_2 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L77] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L80] COND TRUE \read(var_1_7) [L81] var_1_15 = var_1_6 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L83] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L84] COND FALSE !(\read(var_1_4)) [L91] var_1_17 = -32 VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=-800, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-64, var_1_21=-2147483647, var_1_22=0, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L93] var_1_20 = var_1_21 [L94] var_1_22 = var_1_23 [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L144] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L144] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L144] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L144-L145] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=16, var_1_1=0, var_1_20=-2147483647, var_1_21=-2147483647, var_1_22=-256, var_1_23=-256, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 272 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 258 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 520 NumberOfCodeBlocks, 520 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 3024/3024 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-13 00:20:18,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:20:20,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:20:20,907 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:20:20,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:20:20,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:20:20,953 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:20:20,954 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:20:20,954 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:20:20,955 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:20:20,957 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:20:20,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:20:20,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:20:20,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:20:20,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:20:20,959 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:20:20,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:20:20,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:20:20,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:20:20,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:20:20,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:20:20,963 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:20:20,966 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:20:20,966 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:20:20,966 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:20:20,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:20:20,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:20:20,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:20:20,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:20:20,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:20:20,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:20:20,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:20:20,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:20:20,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:20:20,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:20:20,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:20:20,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:20:20,973 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:20:20,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:20:20,974 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:20:20,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:20:20,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:20:20,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:20:20,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:20:20,976 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:20:20,976 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:20:20,976 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/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/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 -> 7ae159cf755ce378f88e7fb84068dbbfe894d6694e3ffbded2db31d9aad9b170 [2024-10-13 00:20:21,320 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:20:21,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:20:21,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:20:21,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:20:21,352 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:20:21,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:22,852 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:20:23,104 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:20:23,104 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:23,118 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab33c8529/aa2c9846fb204294be2bd5c9c3a3b978/FLAG0d3ed906e [2024-10-13 00:20:23,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab33c8529/aa2c9846fb204294be2bd5c9c3a3b978 [2024-10-13 00:20:23,143 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:20:23,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:20:23,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:20:23,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:20:23,154 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:20:23,155 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,156 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d90044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23, skipping insertion in model container [2024-10-13 00:20:23,159 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,193 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:20:23,397 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_codestructure_steplocals_file-97.i[917,930] [2024-10-13 00:20:23,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:20:23,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:20:23,515 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_codestructure_steplocals_file-97.i[917,930] [2024-10-13 00:20:23,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:20:23,570 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:20:23,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23 WrapperNode [2024-10-13 00:20:23,571 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:20:23,572 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:20:23,572 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:20:23,572 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:20:23,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,638 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 160 [2024-10-13 00:20:23,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:20:23,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:20:23,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:20:23,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:20:23,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,664 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,681 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-13 00:20:23,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,694 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:20:23,714 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:20:23,714 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:20:23,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:20:23,715 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (1/1) ... [2024-10-13 00:20:23,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:20:23,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:20:23,755 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:20:23,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:20:23,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:20:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:20:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:20:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:20:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:20:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:20:23,881 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:20:23,884 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:20:24,296 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-13 00:20:24,297 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:20:24,401 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:20:24,401 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:20:24,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:20:24 BoogieIcfgContainer [2024-10-13 00:20:24,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:20:24,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:20:24,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:20:24,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:20:24,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:20:23" (1/3) ... [2024-10-13 00:20:24,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6434ebc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:20:24, skipping insertion in model container [2024-10-13 00:20:24,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:20:23" (2/3) ... [2024-10-13 00:20:24,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6434ebc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:20:24, skipping insertion in model container [2024-10-13 00:20:24,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:20:24" (3/3) ... [2024-10-13 00:20:24,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-97.i [2024-10-13 00:20:24,431 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:20:24,431 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:20:24,506 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:20:24,514 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;@53725d7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:20:24,515 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:20:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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-13 00:20:24,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:20:24,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:20:24,537 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] [2024-10-13 00:20:24,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:20:24,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:20:24,546 INFO L85 PathProgramCache]: Analyzing trace with hash -935249719, now seen corresponding path program 1 times [2024-10-13 00:20:24,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:20:24,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170401163] [2024-10-13 00:20:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:20:24,565 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-13 00:20:24,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:20:24,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-13 00:20:24,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 00:20:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:24,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:20:24,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:20:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 758 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-10-13 00:20:24,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:20:24,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:20:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170401163] [2024-10-13 00:20:24,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170401163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:20:24,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:20:24,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:20:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818308462] [2024-10-13 00:20:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:20:24,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:20:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:20:24,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:20:24,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:20:24,908 INFO L87 Difference]: Start difference. First operand has 68 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 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 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:20:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:20:24,960 INFO L93 Difference]: Finished difference Result 133 states and 242 transitions. [2024-10-13 00:20:24,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:20:24,965 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 167 [2024-10-13 00:20:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:20:24,975 INFO L225 Difference]: With dead ends: 133 [2024-10-13 00:20:24,975 INFO L226 Difference]: Without dead ends: 66 [2024-10-13 00:20:24,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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-13 00:20:24,986 INFO L432 NwaCegarLoop]: 100 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, 100 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-13 00:20:24,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:20:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-13 00:20:25,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-13 00:20:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-13 00:20:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 103 transitions. [2024-10-13 00:20:25,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 103 transitions. Word has length 167 [2024-10-13 00:20:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:20:25,051 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 103 transitions. [2024-10-13 00:20:25,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 00:20:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 103 transitions. [2024-10-13 00:20:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-13 00:20:25,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:20:25,056 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] [2024-10-13 00:20:25,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-10-13 00:20:25,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-13 00:20:25,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:20:25,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:20:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash -575935611, now seen corresponding path program 1 times [2024-10-13 00:20:25,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:20:25,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2085985880] [2024-10-13 00:20:25,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:20:25,260 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-13 00:20:25,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:20:25,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-13 00:20:25,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-13 00:20:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:20:25,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-13 00:20:25,749 INFO L278 TraceCheckSpWp]: Computing forward predicates...