./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-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:35:18,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:35:18,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:35:18,321 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:35:18,321 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:35:18,339 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:35:18,340 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:35:18,341 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:35:18,341 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:35:18,342 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:35:18,342 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:35:18,342 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:35:18,343 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:35:18,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:35:18,347 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:35:18,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:35:18,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:35:18,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:35:18,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:35:18,349 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:35:18,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:35:18,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:35:18,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:35:18,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:35:18,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:35:18,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:35:18,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:35:18,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:35:18,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:35:18,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:35:18,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:35:18,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:35:18,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:18,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:35:18,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:35:18,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:35:18,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:35:18,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:35:18,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:35:18,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:35:18,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:35:18,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:35:18,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b [2024-10-11 07:35:18,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:35:18,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:35:18,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:35:18,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:35:18,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:35:18,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:20,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:35:20,349 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:35:20,349 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:20,360 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/29cdd8cc4/78366adfd71a408c9f1caf8225367df4/FLAG0df2ca24d [2024-10-11 07:35:20,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/29cdd8cc4/78366adfd71a408c9f1caf8225367df4 [2024-10-11 07:35:20,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:35:20,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:35:20,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:20,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:35:20,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:35:20,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:20" (1/1) ... [2024-10-11 07:35:20,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41087f78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:20, skipping insertion in model container [2024-10-11 07:35:20,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:20" (1/1) ... [2024-10-11 07:35:20,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:35:20,903 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-67.i[917,930] [2024-10-11 07:35:20,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:20,993 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:35:21,003 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-67.i[917,930] [2024-10-11 07:35:21,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:21,047 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:35:21,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21 WrapperNode [2024-10-11 07:35:21,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:21,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:21,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:35:21,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:35:21,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,097 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2024-10-11 07:35:21,098 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:21,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:35:21,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:35:21,099 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:35:21,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:35:21,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,137 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,139 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:35:21,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:35:21,140 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:35:21,140 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:35:21,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (1/1) ... [2024-10-11 07:35:21,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:35:21,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:35:21,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:35:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:35:21,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:35:21,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:35:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:35:21,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:35:21,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:35:21,380 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:35:21,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:35:21,706 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 07:35:21,706 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:35:21,752 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:35:21,752 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:35:21,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:21 BoogieIcfgContainer [2024-10-11 07:35:21,753 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:35:21,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:35:21,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:35:21,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:35:21,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:35:20" (1/3) ... [2024-10-11 07:35:21,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8e6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:21, skipping insertion in model container [2024-10-11 07:35:21,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:21" (2/3) ... [2024-10-11 07:35:21,760 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3df8e6f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:21, skipping insertion in model container [2024-10-11 07:35:21,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:21" (3/3) ... [2024-10-11 07:35:21,761 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:21,778 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:35:21,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:35:21,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:35:21,836 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;@794b0af2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:35:21,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:35:21,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 07:35:21,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:21,853 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] [2024-10-11 07:35:21,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1288619156, now seen corresponding path program 1 times [2024-10-11 07:35:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443325215] [2024-10-11 07:35:21,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:21,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:35:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:35:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:35:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:35:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:35:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:35:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:35:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:35:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:35:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:35:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:35:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:35:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:35:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:35:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:35:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:35:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:35:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:35:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:35:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:35:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:35:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:35:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:35:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:35:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:35:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:35:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:35:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:35:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 07:35:22,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:35:22,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443325215] [2024-10-11 07:35:22,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443325215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:22,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:22,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:35:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290232010] [2024-10-11 07:35:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:22,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:35:22,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:35:22,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:35:22,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:35:22,210 INFO L87 Difference]: Start difference. First operand has 82 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 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), 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-11 07:35:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:22,245 INFO L93 Difference]: Finished difference Result 161 states and 284 transitions. [2024-10-11 07:35:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:35:22,248 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), 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 171 [2024-10-11 07:35:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:22,256 INFO L225 Difference]: With dead ends: 161 [2024-10-11 07:35:22,257 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 07:35:22,260 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-11 07:35:22,263 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:22,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:35:22,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 07:35:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 07:35:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 124 transitions. [2024-10-11 07:35:22,326 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 124 transitions. Word has length 171 [2024-10-11 07:35:22,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:22,327 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 124 transitions. [2024-10-11 07:35:22,327 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), 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-11 07:35:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 124 transitions. [2024-10-11 07:35:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 07:35:22,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:22,332 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] [2024-10-11 07:35:22,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:35:22,333 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:22,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 194996724, now seen corresponding path program 1 times [2024-10-11 07:35:22,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:22,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259580917] [2024-10-11 07:35:22,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:22,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:35:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:35:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:35:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:35:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:35:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:35:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:35:23,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:35:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:35:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:35:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 07:35:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:35:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:35:23,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:35:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:35:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:35:23,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:35:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:35:23,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:35:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 07:35:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:35:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 07:35:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:35:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 07:35:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 07:35:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:35:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:35:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 07:35:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:35:23,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:35:23,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259580917] [2024-10-11 07:35:23,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259580917] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:35:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975337377] [2024-10-11 07:35:23,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:23,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:35:23,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:35:23,484 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:35:23,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:35:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:23,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 07:35:23,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-10-11 07:35:24,085 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:35:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:35:24,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975337377] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:35:24,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:35:24,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-11 07:35:24,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749521129] [2024-10-11 07:35:24,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:35:24,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 07:35:24,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:35:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 07:35:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 07:35:24,427 INFO L87 Difference]: Start difference. First operand 80 states and 124 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 07:35:24,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:24,763 INFO L93 Difference]: Finished difference Result 163 states and 248 transitions. [2024-10-11 07:35:24,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:35:24,763 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 171 [2024-10-11 07:35:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:24,766 INFO L225 Difference]: With dead ends: 163 [2024-10-11 07:35:24,766 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 07:35:24,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 394 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-10-11 07:35:24,768 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 252 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:24,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 179 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:35:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 07:35:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-11 07:35:24,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 51 states have internal predecessors, (64), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-10-11 07:35:24,794 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 171 [2024-10-11 07:35:24,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:24,795 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-10-11 07:35:24,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 07:35:24,796 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-10-11 07:35:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 07:35:24,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:24,800 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-11 07:35:24,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:35:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:35:25,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:25,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash 837304618, now seen corresponding path program 1 times [2024-10-11 07:35:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223326419] [2024-10-11 07:35:25,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:35:25,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073026053] [2024-10-11 07:35:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:25,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:35:25,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:35:25,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:35:25,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 07:35:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:35:25,228 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:35:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:35:25,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:35:25,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:35:25,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:35:25,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:35:25,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:35:25,596 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 07:35:25,709 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:35:25,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:35:25 BoogieIcfgContainer [2024-10-11 07:35:25,713 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:35:25,713 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:35:25,714 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:35:25,714 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:35:25,714 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:21" (3/4) ... [2024-10-11 07:35:25,716 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:35:25,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:35:25,718 INFO L158 Benchmark]: Toolchain (without parser) took 4989.52ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 92.6MB in the beginning and 73.3MB in the end (delta: 19.4MB). Peak memory consumption was 93.2MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,718 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 161.5MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:35:25,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.73ms. Allocated memory is still 161.5MB. Free memory was 92.4MB in the beginning and 77.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 161.5MB. Free memory was 77.2MB in the beginning and 74.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,719 INFO L158 Benchmark]: Boogie Preprocessor took 40.83ms. Allocated memory is still 161.5MB. Free memory was 74.0MB in the beginning and 70.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,719 INFO L158 Benchmark]: RCFGBuilder took 612.84ms. Allocated memory is still 161.5MB. Free memory was 70.0MB in the beginning and 107.4MB in the end (delta: -37.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,720 INFO L158 Benchmark]: TraceAbstraction took 3958.12ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 107.4MB in the beginning and 74.3MB in the end (delta: 33.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2024-10-11 07:35:25,720 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 234.9MB. Free memory was 74.3MB in the beginning and 73.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:35:25,721 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.14ms. Allocated memory is still 161.5MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.73ms. Allocated memory is still 161.5MB. Free memory was 92.4MB in the beginning and 77.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 161.5MB. Free memory was 77.2MB in the beginning and 74.0MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.83ms. Allocated memory is still 161.5MB. Free memory was 74.0MB in the beginning and 70.0MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 612.84ms. Allocated memory is still 161.5MB. Free memory was 70.0MB in the beginning and 107.4MB in the end (delta: -37.4MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3958.12ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 107.4MB in the beginning and 74.3MB in the end (delta: 33.1MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 234.9MB. Free memory was 74.3MB in the beginning and 73.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9.75; [L23] signed long int var_1_2 = 100; [L24] unsigned char var_1_3 = 1; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = 10; [L27] unsigned char var_1_6 = 1; [L28] float var_1_7 = 7.5; [L29] signed long int var_1_8 = -1000; [L30] float var_1_9 = 9.25; [L31] float var_1_10 = 64.5; [L32] float var_1_11 = 16.25; [L33] signed char var_1_12 = 2; [L34] signed char var_1_13 = 8; [L35] signed char var_1_14 = 0; [L36] float var_1_15 = 0.6; [L37] signed char var_1_16 = 32; [L38] unsigned short int var_1_17 = 2; [L39] unsigned char var_1_18 = 1; [L40] unsigned short int var_1_19 = 63241; [L41] unsigned short int var_1_20 = 58697; [L42] unsigned short int var_1_21 = 25516; [L43] unsigned long int var_1_22 = 3301682525; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_long() [L93] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L93] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L94] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=25, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=10, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L98] var_1_5 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L99] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L100] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=1, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L101] var_1_6 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_6 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L102] RET assume_abort_if_not(var_1_6 >= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L103] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L103] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=-1000, var_1_9=37/4] [L104] var_1_8 = __VERIFIER_nondet_long() [L105] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L105] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L106] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L106] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L107] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L107] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=37/4] [L108] var_1_9 = __VERIFIER_nondet_float() [L109] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L109] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=129/2, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L110] var_1_10 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L111] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65/4, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L112] var_1_11 = __VERIFIER_nondet_float() [L113] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L113] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=2, var_1_13=8, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L114] var_1_13 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L115] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L116] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L116] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L117] var_1_14 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L119] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L119] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L120] var_1_18 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L121] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L122] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L122] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=63241, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L123] var_1_19 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_19 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L124] RET assume_abort_if_not(var_1_19 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L125] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L125] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=58697, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L126] var_1_20 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L127] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L128] CALL assume_abort_if_not(var_1_20 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L128] RET assume_abort_if_not(var_1_20 <= 65534) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=25516, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L129] var_1_21 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_21 >= 24575) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L130] RET assume_abort_if_not(var_1_21 >= 24575) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L131] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L131] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=3301682525, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L132] var_1_22 = __VERIFIER_nondet_ulong() [L133] CALL assume_abort_if_not(var_1_22 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L133] RET assume_abort_if_not(var_1_22 >= 2147483647) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L134] CALL assume_abort_if_not(var_1_22 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L134] RET assume_abort_if_not(var_1_22 <= 4294967295) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L147] RET updateVariables() [L148] CALL step() [L47] COND FALSE !(50 != var_1_2) VAL [isInitial=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L50] var_1_3 = (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6) [L51] signed long int stepLocal_1 = (var_1_2 + 100) / var_1_8; [L52] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L53] COND FALSE !(stepLocal_1 >= var_1_5) VAL [isInitial=1, stepLocal_0=1, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=3/5, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151] [L60] var_1_12 = (var_1_13 - var_1_14) [L61] var_1_15 = ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) VAL [isInitial=1, stepLocal_0=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L62] EXPR ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2 VAL [isInitial=1, stepLocal_0=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L62] signed long int stepLocal_2 = ((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2; [L63] COND FALSE !(var_1_1 > (var_1_11 + var_1_7)) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L72] unsigned long int stepLocal_3 = var_1_22 - var_1_20; VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450880, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L73] COND TRUE \read(var_1_3) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450880, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L74] COND TRUE \read(var_1_6) VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450880, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=2, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L75] COND TRUE \read(var_1_18) [L76] var_1_17 = var_1_14 VAL [isInitial=1, stepLocal_0=1, stepLocal_2=50, stepLocal_3=2147450880, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR ((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L139-L140] return (((((((50 != var_1_2) ? (var_1_1 == ((double) (1.00000000000025E12 - 24.25))) : 1) && (var_1_3 == ((unsigned char) (((5 - var_1_4) <= (var_1_2 + var_1_5)) || var_1_6)))) && ((((var_1_2 + 100) / var_1_8) >= var_1_5) ? ((var_1_3 || (var_1_5 > (var_1_4 * var_1_8))) ? (var_1_7 == ((float) var_1_9)) : (var_1_7 == ((float) (var_1_10 + var_1_11)))) : 1)) && (var_1_12 == ((signed char) (var_1_13 - var_1_14)))) && (var_1_15 == ((float) ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9)))))) && ((var_1_1 > (var_1_11 + var_1_7)) ? ((var_1_14 < (((((var_1_13) > (var_1_4)) ? (var_1_13) : (var_1_4))) | var_1_2)) ? (var_1_3 ? (var_1_16 == ((signed char) -2)) : 1) : (var_1_16 == ((signed char) var_1_13))) : 1)) && (var_1_3 ? (var_1_6 ? (var_1_18 ? (var_1_17 == ((unsigned short int) var_1_14)) : (var_1_17 == ((unsigned short int) (((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))) - ((var_1_21 - 256) - 256))))) : (((var_1_22 - var_1_20) > (var_1_4 / var_1_8)) ? ((var_1_15 >= var_1_10) ? (var_1_17 == ((unsigned short int) var_1_14)) : 1) : 1)) : (var_1_17 == ((unsigned short int) var_1_21))) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_16=32, var_1_17=0, var_1_18=1, var_1_19=-32769, var_1_1=39/4, var_1_20=-98305, var_1_21=24575, var_1_22=2147483647, var_1_2=50, var_1_3=1, var_1_4=50, var_1_5=1, var_1_6=-255, var_1_7=15/2, var_1_8=151, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 252 mSDsluCounter, 300 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 198 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 198 mSolverCounterUnsat, 200 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 480 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=82occurred in iteration=0, InterpolantAutomatonStates: 11, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 859 NumberOfCodeBlocks, 859 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 680 ConstructedInterpolants, 0 QuantifiedInterpolants, 2412 SizeOfPredicates, 8 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 5859/6048 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:35:25,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:35:27,908 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:35:27,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:35:27,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:35:27,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:35:28,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:35:28,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:35:28,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:35:28,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:35:28,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:35:28,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:35:28,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:35:28,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:35:28,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:35:28,010 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:35:28,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:35:28,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:35:28,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:35:28,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:35:28,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:35:28,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:35:28,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:35:28,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:35:28,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:35:28,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:35:28,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:35:28,017 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:35:28,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:35:28,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:35:28,019 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:35:28,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:35:28,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:35:28,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:35:28,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:35:28,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:28,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:35:28,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:35:28,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:35:28,022 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:35:28,022 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:35:28,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:35:28,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:35:28,023 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:35:28,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:35:28,023 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:35:28,023 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f54764d92324579175129cff81b75b12b435de643e9d08601cad3992eb80719b [2024-10-11 07:35:28,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:35:28,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:35:28,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:35:28,437 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:35:28,437 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:35:28,439 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:29,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:35:30,043 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:35:30,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:30,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad05e10ac/0710aafca44d49208b857f43f371635d/FLAG0b1482456 [2024-10-11 07:35:30,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ad05e10ac/0710aafca44d49208b857f43f371635d [2024-10-11 07:35:30,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:35:30,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:35:30,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:30,096 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:35:30,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:35:30,100 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a03e0d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30, skipping insertion in model container [2024-10-11 07:35:30,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:35:30,273 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-67.i[917,930] [2024-10-11 07:35:30,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:30,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:35:30,352 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-67.i[917,930] [2024-10-11 07:35:30,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:30,394 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:35:30,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30 WrapperNode [2024-10-11 07:35:30,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:30,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:30,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:35:30,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:35:30,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,417 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,442 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-11 07:35:30,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:30,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:35:30,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:35:30,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:35:30,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,457 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,471 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:35:30,472 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,482 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,503 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,504 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,511 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:35:30,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:35:30,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:35:30,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:35:30,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (1/1) ... [2024-10-11 07:35:30,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:30,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:35:30,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:35:30,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:35:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:35:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:35:30,587 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:35:30,588 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:35:30,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:35:30,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:35:30,651 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:35:30,652 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:35:32,542 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 07:35:32,542 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:35:32,579 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:35:32,580 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:35:32,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:32 BoogieIcfgContainer [2024-10-11 07:35:32,580 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:35:32,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:35:32,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:35:32,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:35:32,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:35:30" (1/3) ... [2024-10-11 07:35:32,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526befd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:32, skipping insertion in model container [2024-10-11 07:35:32,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:30" (2/3) ... [2024-10-11 07:35:32,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@526befd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:32, skipping insertion in model container [2024-10-11 07:35:32,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:32" (3/3) ... [2024-10-11 07:35:32,590 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-67.i [2024-10-11 07:35:32,604 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:35:32,604 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:35:32,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:35:32,669 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;@685e0be0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:35:32,669 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:35:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:32,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:35:32,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:32,702 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-11 07:35:32,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:32,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash 905056768, now seen corresponding path program 1 times [2024-10-11 07:35:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:32,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062523282] [2024-10-11 07:35:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:32,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:35:32,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:32,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:35:32,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:35:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:33,060 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:35:33,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 774 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2024-10-11 07:35:33,117 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:35:33,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:35:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062523282] [2024-10-11 07:35:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062523282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:33,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:33,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:35:33,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737400350] [2024-10-11 07:35:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:33,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:35:33,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:35:33,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:35:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:35:33,159 INFO L87 Difference]: Start difference. First operand has 70 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 40 states have internal predecessors, (55), 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-11 07:35:34,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:34,448 INFO L93 Difference]: Finished difference Result 137 states and 248 transitions. [2024-10-11 07:35:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:35:34,473 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-11 07:35:34,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:34,480 INFO L225 Difference]: With dead ends: 137 [2024-10-11 07:35:34,480 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 07:35:34,484 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-11 07:35:34,486 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:34,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 07:35:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 07:35:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-11 07:35:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 106 transitions. [2024-10-11 07:35:34,521 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 106 transitions. Word has length 167 [2024-10-11 07:35:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:34,522 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 106 transitions. [2024-10-11 07:35:34,522 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-11 07:35:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 106 transitions. [2024-10-11 07:35:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 07:35:34,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:34,525 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-11 07:35:34,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:35:34,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:35:34,731 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:34,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:34,732 INFO L85 PathProgramCache]: Analyzing trace with hash 395101320, now seen corresponding path program 1 times [2024-10-11 07:35:34,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [624665114] [2024-10-11 07:35:34,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:35:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:34,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:35:34,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:35:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:34,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 07:35:35,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 543 proven. 63 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-10-11 07:35:35,494 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:35:35,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 18 proven. 63 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 07:35:35,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:35:35,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [624665114] [2024-10-11 07:35:35,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [624665114] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:35:35,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:35:35,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-10-11 07:35:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831377981] [2024-10-11 07:35:35,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:35:35,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 07:35:35,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:35:35,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 07:35:35,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:35:35,902 INFO L87 Difference]: Start difference. First operand 68 states and 106 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 07:35:37,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:37,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:37,788 INFO L93 Difference]: Finished difference Result 139 states and 212 transitions. [2024-10-11 07:35:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:35:37,818 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 167 [2024-10-11 07:35:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:37,820 INFO L225 Difference]: With dead ends: 139 [2024-10-11 07:35:37,821 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 07:35:37,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2024-10-11 07:35:37,825 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 94 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:37,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 129 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 07:35:37,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 07:35:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2024-10-11 07:35:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 07:35:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-10-11 07:35:37,856 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 167 [2024-10-11 07:35:37,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:37,857 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-10-11 07:35:37,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2024-10-11 07:35:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-10-11 07:35:37,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:35:37,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:37,864 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] [2024-10-11 07:35:37,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:35:38,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:35:38,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:38,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 913545758, now seen corresponding path program 1 times [2024-10-11 07:35:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422329217] [2024-10-11 07:35:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:35:38,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:38,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:35:38,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:35:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:38,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 07:35:38,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:36:43,440 WARN L286 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)