./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:06:36,250 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:06:36,324 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:06:36,330 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:06:36,332 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:06:36,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:06:36,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:06:36,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:06:36,359 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:06:36,360 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:06:36,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:06:36,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:06:36,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:06:36,362 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:06:36,363 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:06:36,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:06:36,364 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:06:36,364 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:06:36,364 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:06:36,364 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:06:36,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:06:36,367 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:06:36,367 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:06:36,367 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:06:36,367 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:06:36,368 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:06:36,368 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:06:36,368 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:06:36,368 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:06:36,368 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:06:36,368 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:06:36,369 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:06:36,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:36,369 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:06:36,369 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:06:36,369 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:06:36,369 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:06:36,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:06:36,370 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:06:36,370 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:06:36,371 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:06:36,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:06:36,371 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2024-11-12 05:06:36,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:06:36,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:06:36,635 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:06:36,636 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:06:36,637 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:06:36,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:06:38,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:06:38,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:06:38,339 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:06:38,348 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c4f38fd/6462089d22c348d5be970330955c8274/FLAG4c78a9c39 [2024-11-12 05:06:38,664 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04c4f38fd/6462089d22c348d5be970330955c8274 [2024-11-12 05:06:38,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:06:38,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:06:38,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:38,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:06:38,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:06:38,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:38" (1/1) ... [2024-11-12 05:06:38,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6752e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:38, skipping insertion in model container [2024-11-12 05:06:38,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:38" (1/1) ... [2024-11-12 05:06:38,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:06:38,920 WARN L250 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_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-12 05:06:39,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:39,039 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:06:39,050 WARN L250 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_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-12 05:06:39,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:39,188 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:06:39,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39 WrapperNode [2024-11-12 05:06:39,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:39,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:39,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:06:39,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:06:39,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,257 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 263 [2024-11-12 05:06:39,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:39,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:06:39,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:06:39,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:06:39,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,308 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-11-12 05:06:39,308 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,308 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:06:39,360 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:06:39,360 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:06:39,360 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:06:39,365 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (1/1) ... [2024-11-12 05:06:39,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:06:39,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:06:39,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:06:39,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:06:39,528 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:06:39,529 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:06:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:06:39,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:06:39,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:06:39,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:06:39,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:06:40,093 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-12 05:06:40,095 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:06:40,107 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:06:40,107 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:06:40,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:40 BoogieIcfgContainer [2024-11-12 05:06:40,108 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:06:40,109 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:06:40,109 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:06:40,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:06:40,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:06:38" (1/3) ... [2024-11-12 05:06:40,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae3158b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:40, skipping insertion in model container [2024-11-12 05:06:40,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:39" (2/3) ... [2024-11-12 05:06:40,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae3158b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:06:40, skipping insertion in model container [2024-11-12 05:06:40,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:40" (3/3) ... [2024-11-12 05:06:40,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:06:40,129 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:06:40,129 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:06:40,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:06:40,197 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;@64bd7b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:06:40,198 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:06:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 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-11-12 05:06:40,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 05:06:40,217 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:40,217 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:40,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 537113741, now seen corresponding path program 1 times [2024-11-12 05:06:40,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:40,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213190014] [2024-11-12 05:06:40,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:40,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:40,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:40,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:40,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:40,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213190014] [2024-11-12 05:06:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213190014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:40,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:40,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:06:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561183823] [2024-11-12 05:06:40,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:40,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:06:40,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:40,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:06:40,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:06:40,817 INFO L87 Difference]: Start difference. First operand has 113 states, 82 states have (on average 1.4634146341463414) internal successors, (120), 83 states have internal predecessors, (120), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-11-12 05:06:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:40,843 INFO L93 Difference]: Finished difference Result 219 states and 374 transitions. [2024-11-12 05:06:40,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:06:40,845 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 188 [2024-11-12 05:06:40,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:40,852 INFO L225 Difference]: With dead ends: 219 [2024-11-12 05:06:40,852 INFO L226 Difference]: Without dead ends: 109 [2024-11-12 05:06:40,856 INFO L434 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-11-12 05:06:40,859 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:40,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:06:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-12 05:06:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-12 05:06:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 79 states have internal predecessors, (113), 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-11-12 05:06:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 169 transitions. [2024-11-12 05:06:40,910 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 169 transitions. Word has length 188 [2024-11-12 05:06:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:40,911 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 169 transitions. [2024-11-12 05:06:40,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-11-12 05:06:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 169 transitions. [2024-11-12 05:06:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 05:06:40,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:40,916 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:40,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:06:40,916 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:40,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:40,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1192170987, now seen corresponding path program 1 times [2024-11-12 05:06:40,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:40,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886650425] [2024-11-12 05:06:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:41,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:41,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:41,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886650425] [2024-11-12 05:06:41,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886650425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:41,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:41,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:06:41,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779456949] [2024-11-12 05:06:41,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:41,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:06:41,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:41,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:06:41,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:41,273 INFO L87 Difference]: Start difference. First operand 109 states and 169 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:41,358 INFO L93 Difference]: Finished difference Result 316 states and 491 transitions. [2024-11-12 05:06:41,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:06:41,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-12 05:06:41,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:41,365 INFO L225 Difference]: With dead ends: 316 [2024-11-12 05:06:41,365 INFO L226 Difference]: Without dead ends: 210 [2024-11-12 05:06:41,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:41,367 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 150 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:41,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 457 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:06:41,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-12 05:06:41,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 136. [2024-11-12 05:06:41,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 106 states have (on average 1.4528301886792452) internal successors, (154), 106 states have internal predecessors, (154), 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-11-12 05:06:41,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 210 transitions. [2024-11-12 05:06:41,402 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 210 transitions. Word has length 188 [2024-11-12 05:06:41,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:41,403 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 210 transitions. [2024-11-12 05:06:41,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:41,404 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 210 transitions. [2024-11-12 05:06:41,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-12 05:06:41,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:41,413 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:41,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:06:41,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:41,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:41,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1051622377, now seen corresponding path program 1 times [2024-11-12 05:06:41,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:41,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030378539] [2024-11-12 05:06:41,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:41,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:41,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:41,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:41,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:41,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030378539] [2024-11-12 05:06:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030378539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:06:41,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68663631] [2024-11-12 05:06:41,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:41,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:06:41,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:06:41,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:41,715 INFO L87 Difference]: Start difference. First operand 136 states and 210 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:41,801 INFO L93 Difference]: Finished difference Result 402 states and 624 transitions. [2024-11-12 05:06:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:06:41,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-12 05:06:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:41,805 INFO L225 Difference]: With dead ends: 402 [2024-11-12 05:06:41,806 INFO L226 Difference]: Without dead ends: 269 [2024-11-12 05:06:41,808 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:41,810 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:41,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 374 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:06:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-12 05:06:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 207. [2024-11-12 05:06:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 177 states have (on average 1.497175141242938) internal successors, (265), 177 states have internal predecessors, (265), 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-11-12 05:06:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 321 transitions. [2024-11-12 05:06:41,844 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 321 transitions. Word has length 188 [2024-11-12 05:06:41,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:41,845 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 321 transitions. [2024-11-12 05:06:41,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 321 transitions. [2024-11-12 05:06:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 05:06:41,850 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:41,851 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:41,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:06:41,851 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:41,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:41,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1700510734, now seen corresponding path program 1 times [2024-11-12 05:06:41,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:41,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236942954] [2024-11-12 05:06:41,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:42,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:42,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236942954] [2024-11-12 05:06:42,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236942954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:42,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:42,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:06:42,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114504032] [2024-11-12 05:06:42,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:42,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:06:42,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:42,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:06:42,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:06:42,100 INFO L87 Difference]: Start difference. First operand 207 states and 321 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:42,241 INFO L93 Difference]: Finished difference Result 557 states and 863 transitions. [2024-11-12 05:06:42,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:06:42,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 05:06:42,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:42,244 INFO L225 Difference]: With dead ends: 557 [2024-11-12 05:06:42,244 INFO L226 Difference]: Without dead ends: 353 [2024-11-12 05:06:42,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:06:42,249 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 136 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:42,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 314 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:06:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-12 05:06:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 318. [2024-11-12 05:06:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 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-11-12 05:06:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2024-11-12 05:06:42,279 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2024-11-12 05:06:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:42,280 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2024-11-12 05:06:42,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2024-11-12 05:06:42,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 05:06:42,284 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:42,285 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:42,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:06:42,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:42,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:42,285 INFO L85 PathProgramCache]: Analyzing trace with hash 531683155, now seen corresponding path program 1 times [2024-11-12 05:06:42,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:42,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848642161] [2024-11-12 05:06:42,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:42,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:42,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:42,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848642161] [2024-11-12 05:06:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848642161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:42,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:06:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736548682] [2024-11-12 05:06:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:06:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:06:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:42,460 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:42,530 INFO L93 Difference]: Finished difference Result 822 states and 1279 transitions. [2024-11-12 05:06:42,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:06:42,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 05:06:42,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:42,535 INFO L225 Difference]: With dead ends: 822 [2024-11-12 05:06:42,535 INFO L226 Difference]: Without dead ends: 507 [2024-11-12 05:06:42,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:06:42,537 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 144 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:42,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 455 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:06:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-12 05:06:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 318. [2024-11-12 05:06:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 288 states have (on average 1.5173611111111112) internal successors, (437), 288 states have internal predecessors, (437), 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-11-12 05:06:42,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 493 transitions. [2024-11-12 05:06:42,555 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 493 transitions. Word has length 189 [2024-11-12 05:06:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:42,556 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 493 transitions. [2024-11-12 05:06:42,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 493 transitions. [2024-11-12 05:06:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-12 05:06:42,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:42,558 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:42,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:06:42,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1840056107, now seen corresponding path program 1 times [2024-11-12 05:06:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:42,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312123753] [2024-11-12 05:06:42,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:42,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:42,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:42,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:42,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312123753] [2024-11-12 05:06:42,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312123753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:42,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:42,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:06:42,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303439224] [2024-11-12 05:06:42,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:42,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:06:42,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:42,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:06:42,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:06:42,792 INFO L87 Difference]: Start difference. First operand 318 states and 493 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:42,899 INFO L93 Difference]: Finished difference Result 701 states and 1088 transitions. [2024-11-12 05:06:42,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:06:42,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 189 [2024-11-12 05:06:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:42,903 INFO L225 Difference]: With dead ends: 701 [2024-11-12 05:06:42,903 INFO L226 Difference]: Without dead ends: 386 [2024-11-12 05:06:42,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:06:42,904 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 46 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:42,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 296 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:06:42,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-12 05:06:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 324. [2024-11-12 05:06:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 294 states have (on average 1.5136054421768708) internal successors, (445), 294 states have internal predecessors, (445), 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-11-12 05:06:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 501 transitions. [2024-11-12 05:06:42,914 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 501 transitions. Word has length 189 [2024-11-12 05:06:42,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:42,915 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 501 transitions. [2024-11-12 05:06:42,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 501 transitions. [2024-11-12 05:06:42,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 05:06:42,917 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:42,918 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:42,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:06:42,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:42,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 134723730, now seen corresponding path program 1 times [2024-11-12 05:06:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:42,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192412866] [2024-11-12 05:06:42,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:42,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:06:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:06:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:06:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:06:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:06:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:06:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:06:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:06:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:06:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:06:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:06:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:06:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:06:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:06:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 05:06:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 05:06:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:06:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:06:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 05:06:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 05:06:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:06:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 05:06:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:06:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 05:06:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 05:06:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-12 05:06:43,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:06:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-12 05:06:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:06:43,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:06:43,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:06:43,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192412866] [2024-11-12 05:06:43,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192412866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:06:43,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:06:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:06:43,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845012072] [2024-11-12 05:06:43,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:06:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:06:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:06:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:06:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:06:43,175 INFO L87 Difference]: Start difference. First operand 324 states and 501 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:06:43,526 INFO L93 Difference]: Finished difference Result 964 states and 1474 transitions. [2024-11-12 05:06:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 05:06:43,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-12 05:06:43,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:06:43,530 INFO L225 Difference]: With dead ends: 964 [2024-11-12 05:06:43,531 INFO L226 Difference]: Without dead ends: 643 [2024-11-12 05:06:43,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 05:06:43,533 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 273 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:06:43,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 667 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:06:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2024-11-12 05:06:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 457. [2024-11-12 05:06:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 427 states have (on average 1.515222482435597) internal successors, (647), 427 states have internal predecessors, (647), 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-11-12 05:06:43,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 703 transitions. [2024-11-12 05:06:43,549 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 703 transitions. Word has length 190 [2024-11-12 05:06:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:06:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 703 transitions. [2024-11-12 05:06:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:06:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 703 transitions. [2024-11-12 05:06:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-12 05:06:43,553 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:06:43,553 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:43,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:06:43,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:06:43,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:06:43,554 INFO L85 PathProgramCache]: Analyzing trace with hash -107354308, now seen corresponding path program 1 times [2024-11-12 05:06:43,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:06:43,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218119337] [2024-11-12 05:06:43,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:43,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:06:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:06:43,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275954771] [2024-11-12 05:06:43,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:06:43,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:06:43,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:06:43,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:06:43,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:06:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:06:43,872 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:06:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:06:44,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:06:44,116 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:06:44,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:06:44,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:06:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:06:44,326 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:06:44,461 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:06:44,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:06:44 BoogieIcfgContainer [2024-11-12 05:06:44,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:06:44,465 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:06:44,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:06:44,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:06:44,465 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:06:40" (3/4) ... [2024-11-12 05:06:44,467 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:06:44,468 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:06:44,469 INFO L158 Benchmark]: Toolchain (without parser) took 5800.92ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 125.8MB in the beginning and 195.8MB in the end (delta: -70.0MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,469 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:06:44,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.32ms. Allocated memory is still 195.0MB. Free memory was 125.5MB in the beginning and 107.4MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.32ms. Allocated memory is still 195.0MB. Free memory was 107.4MB in the beginning and 102.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,470 INFO L158 Benchmark]: Boogie Preprocessor took 101.14ms. Allocated memory is still 195.0MB. Free memory was 102.8MB in the beginning and 96.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,470 INFO L158 Benchmark]: RCFGBuilder took 747.88ms. Allocated memory is still 195.0MB. Free memory was 96.5MB in the beginning and 137.3MB in the end (delta: -40.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,470 INFO L158 Benchmark]: TraceAbstraction took 4355.34ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 195.8MB in the end (delta: -59.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-12 05:06:44,470 INFO L158 Benchmark]: Witness Printer took 3.61ms. Allocated memory is still 272.6MB. Free memory is still 195.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:06:44,471 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 113.2MB. Free memory is still 76.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.32ms. Allocated memory is still 195.0MB. Free memory was 125.5MB in the beginning and 107.4MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.32ms. Allocated memory is still 195.0MB. Free memory was 107.4MB in the beginning and 102.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.14ms. Allocated memory is still 195.0MB. Free memory was 102.8MB in the beginning and 96.8MB in the end (delta: 6.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 747.88ms. Allocated memory is still 195.0MB. Free memory was 96.5MB in the beginning and 137.3MB in the end (delta: -40.8MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4355.34ms. Allocated memory was 195.0MB in the beginning and 272.6MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 195.8MB in the end (delta: -59.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 3.61ms. Allocated memory is still 272.6MB. Free memory is still 195.8MB. 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 someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 193. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_3 = 32; [L24] unsigned char var_1_4 = 4; [L25] double var_1_5 = 128.5; [L26] signed long int var_1_6 = 64; [L27] signed long int var_1_7 = 4; [L28] double var_1_8 = 1.875; [L29] double var_1_9 = 0.1; [L30] double var_1_10 = 32.6; [L31] double var_1_11 = 0.6; [L32] signed long int var_1_12 = -128; [L33] signed long int var_1_14 = 16; [L34] signed short int var_1_15 = 1; [L35] signed long int var_1_18 = 2; [L36] signed char var_1_19 = 32; [L37] signed char var_1_20 = 50; [L38] signed short int var_1_21 = 16; [L39] unsigned char var_1_22 = 0; [L40] signed long int var_1_23 = 25; [L41] unsigned short int var_1_24 = 50906; [L42] unsigned short int var_1_25 = 21992; [L43] float var_1_26 = 3.25; [L44] float var_1_27 = 10.2; [L45] float var_1_28 = 16.5; [L46] float var_1_29 = 0.0; [L47] float var_1_30 = 99.8; [L48] signed char var_1_31 = 2; [L49] float var_1_33 = 4.2; [L50] unsigned char last_1_var_1_1 = 32; [L51] unsigned char last_1_var_1_22 = 0; [L52] signed long int last_1_var_1_23 = 25; VAL [isInitial=0, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_22 = var_1_22 [L190] last_1_var_1_23 = var_1_23 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=32, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L142] var_1_3 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L143] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] CALL assume_abort_if_not(var_1_3 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L144] RET assume_abort_if_not(var_1_3 <= 64) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=4, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L147] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=64, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L148] var_1_6 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_6 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L149] RET assume_abort_if_not(var_1_6 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] CALL assume_abort_if_not(var_1_6 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L150] RET assume_abort_if_not(var_1_6 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L151] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=4, var_1_8=15/8, var_1_9=1/10] [L152] var_1_7 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L153] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L154] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L155] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_8=15/8, var_1_9=1/10] [L156] var_1_8 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L157] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3, var_1_9=1/10] [L158] var_1_9 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L159] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=163/5, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L160] var_1_10 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L161] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_11=3/5, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L162] var_1_11 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L163] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=2, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L164] var_1_18 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_18 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L165] RET assume_abort_if_not(var_1_18 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L166] CALL assume_abort_if_not(var_1_18 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L166] RET assume_abort_if_not(var_1_18 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L167] CALL assume_abort_if_not(var_1_18 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L167] RET assume_abort_if_not(var_1_18 != 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=50, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L168] var_1_20 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_20 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L169] RET assume_abort_if_not(var_1_20 >= -63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L170] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L170] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=50906, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L171] var_1_24 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L172] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L173] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L173] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=21992, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L174] var_1_25 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L175] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L176] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L176] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_27=51/5, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L177] var_1_27 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L178] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_28=33/2, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L179] var_1_28 = __VERIFIER_nondet_float() [L180] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L180] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_29=0, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L181] var_1_29 = __VERIFIER_nondet_float() [L182] CALL assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L182] RET assume_abort_if_not((var_1_29 >= 4611686.018427382800e+12F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 9223372.036854765600e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=2, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L183] var_1_31 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L184] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L185] CALL assume_abort_if_not(var_1_31 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L185] RET assume_abort_if_not(var_1_31 <= 127) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=1, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(last_1_var_1_22 || last_1_var_1_22) [L63] var_1_15 = 2 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=21/5, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L65] var_1_22 = 0 [L66] var_1_33 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L67] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L70] unsigned char stepLocal_1 = var_1_22; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_1=0, var_1_10=2, var_1_12=-128, var_1_14=16, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L71] COND TRUE stepLocal_1 || (var_1_4 <= (- var_1_6)) [L72] var_1_14 = ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L76] signed long int stepLocal_0 = (var_1_3 / 1) / var_1_6; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=257/2, var_1_6=-5, var_1_7=3] [L77] COND FALSE !(\read(var_1_22)) [L84] var_1_5 = var_1_10 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L86] signed long int stepLocal_4 = (((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)); VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_4=3, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=25, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L87] COND FALSE !((var_1_24 - (var_1_25 - var_1_3)) <= stepLocal_4) [L94] var_1_23 = var_1_1 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, var_1_10=2, var_1_12=-128, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L96] var_1_12 = ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100)))) [L97] signed long int stepLocal_7 = -1; [L98] signed long int stepLocal_6 = 0 & var_1_25; [L99] signed short int stepLocal_5 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_5=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L100] COND FALSE !(stepLocal_5 < var_1_15) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=32, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L109] COND TRUE var_1_9 > (var_1_26 * var_1_8) [L110] var_1_19 = var_1_4 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L114] signed short int stepLocal_3 = var_1_15; VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] EXPR 5 | var_1_3 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] EXPR var_1_4 << var_1_18 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L115] unsigned char stepLocal_2 = (5 | var_1_3) < (var_1_4 << var_1_18); [L116] COND FALSE !(stepLocal_2 && (var_1_19 < var_1_23)) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_3=2, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=16, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L119] COND TRUE var_1_18 > stepLocal_3 [L120] var_1_21 = var_1_20 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L125] EXPR var_1_15 ^ var_1_21 VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, stepLocal_0=-1, stepLocal_6=0, stepLocal_7=-1, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L125] COND FALSE !((var_1_15 ^ var_1_21) <= var_1_21) [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4)))) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L193] EXPR ((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L193-L194] return (((((((((((var_1_22 ? (var_1_1 == ((unsigned char) ((var_1_3 + var_1_4) + 8))) : 1) && (var_1_22 ? ((((var_1_3 / 1) / var_1_6) == ((var_1_14 * var_1_4) % var_1_7)) ? (var_1_5 == ((double) (((((var_1_8 - var_1_9)) > (var_1_10)) ? ((var_1_8 - var_1_9)) : (var_1_10))))) : (var_1_5 == ((double) var_1_11))) : (var_1_5 == ((double) var_1_10)))) && (var_1_12 == ((signed long int) ((((((var_1_23) < (var_1_3)) ? (var_1_23) : (var_1_3))) + var_1_4) + ((((var_1_1) < (100)) ? (var_1_1) : (100))))))) && ((var_1_22 || (var_1_4 <= (- var_1_6))) ? (var_1_14 == ((signed long int) ((((((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) > (var_1_15)) ? (((((var_1_3) > (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_15))))) : (var_1_14 == ((signed long int) 5)))) && ((last_1_var_1_22 || last_1_var_1_22) ? (((last_1_var_1_1 * (last_1_var_1_23 % var_1_7)) < (var_1_6 / var_1_18)) ? (var_1_15 == ((signed short int) 10)) : (var_1_15 == ((signed short int) var_1_4))) : (var_1_15 == ((signed short int) 2)))) && ((var_1_9 > (var_1_26 * var_1_8)) ? (var_1_19 == ((signed char) var_1_4)) : (var_1_19 == ((signed char) (var_1_4 + var_1_20))))) && ((((5 | var_1_3) < (var_1_4 << var_1_18)) && (var_1_19 < var_1_23)) ? (var_1_21 == ((signed short int) var_1_3)) : ((var_1_18 > var_1_15) ? (var_1_21 == ((signed short int) var_1_20)) : (var_1_21 == ((signed short int) var_1_4))))) && (var_1_22 == ((unsigned char) 0))) && (((var_1_24 - (var_1_25 - var_1_3)) <= ((((var_1_15) > (var_1_7)) ? (var_1_15) : (var_1_7)))) ? (var_1_22 ? (var_1_23 == ((signed long int) (var_1_24 - var_1_25))) : (var_1_23 == ((signed long int) 50))) : (var_1_23 == ((signed long int) var_1_1)))) && ((var_1_15 < var_1_15) ? ((-1 >= var_1_23) ? ((var_1_23 <= (0 & var_1_25)) ? (var_1_26 == ((float) (var_1_9 - (var_1_27 + var_1_28)))) : 1) : (var_1_26 == ((float) (((((var_1_9) > ((var_1_29 - var_1_28))) ? (var_1_9) : ((var_1_29 - var_1_28)))) - var_1_27)))) : 1)) && (((var_1_15 ^ var_1_21) <= var_1_21) ? ((var_1_22 && var_1_22) ? (var_1_22 ? (var_1_30 == ((float) ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))))) : 1) : ((((var_1_3 + var_1_4) - var_1_31) <= var_1_21) ? ((var_1_20 < var_1_1) ? (var_1_30 == ((float) (var_1_9 - var_1_27))) : (var_1_30 == ((float) ((((var_1_10) > (var_1_8)) ? (var_1_10) : (var_1_8)))))) : 1)) : 1)) && (var_1_33 == ((float) var_1_10)) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=32, last_1_var_1_22=0, last_1_var_1_23=25, var_1_10=2, var_1_12=37, var_1_14=5, var_1_15=2, var_1_18=5, var_1_19=0, var_1_1=32, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=32, var_1_24=32767, var_1_25=16383, var_1_26=13/4, var_1_30=499/5, var_1_31=0, var_1_33=2, var_1_3=5, var_1_4=0, var_1_5=2, var_1_6=-5, var_1_7=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 893 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 893 mSDsluCounter, 2732 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 625 IncrementalHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1531 mSDtfsCounter, 625 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 451 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=7, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 608 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1701 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 1614 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10584/10584 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:06:44,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:06:46,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:06:46,776 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:06:46,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:06:46,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:06:46,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:06:46,807 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:06:46,808 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:06:46,809 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:06:46,809 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:06:46,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:06:46,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:06:46,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:06:46,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:06:46,812 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:06:46,812 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:06:46,812 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:06:46,812 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:06:46,813 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:06:46,813 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:06:46,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:06:46,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:06:46,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:06:46,816 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:06:46,816 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:06:46,817 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:06:46,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:06:46,818 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:06:46,818 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:06:46,818 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:46,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:06:46,826 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:06:46,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:06:46,826 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:06:46,826 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:06:46,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:06:46,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:06:46,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:06:46,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:06:46,827 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ecdf8d41b5f6c0ae032c08a143072655ea9b42f95f86d6c7e3ca37b919c75feb [2024-11-12 05:06:47,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:06:47,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:06:47,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:06:47,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:06:47,144 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:06:47,145 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:06:48,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:06:48,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:06:48,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:06:48,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1d9b878/0ee6d2f086404a89bed54dde8254a9e6/FLAG8a106c4da [2024-11-12 05:06:48,711 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e1d9b878/0ee6d2f086404a89bed54dde8254a9e6 [2024-11-12 05:06:48,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:06:48,715 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:06:48,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:48,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:06:48,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:06:48,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:48" (1/1) ... [2024-11-12 05:06:48,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f407ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:48, skipping insertion in model container [2024-11-12 05:06:48,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:06:48" (1/1) ... [2024-11-12 05:06:48,754 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:06:48,905 WARN L250 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_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-12 05:06:48,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:49,039 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:06:49,051 WARN L250 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_loopvsstraightlinecode_100-while_file-15.i[916,929] [2024-11-12 05:06:49,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:06:49,119 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:06:49,120 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49 WrapperNode [2024-11-12 05:06:49,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:06:49,121 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:49,121 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:06:49,121 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:06:49,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,163 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-12 05:06:49,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:06:49,164 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:06:49,164 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:06:49,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:06:49,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,199 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-11-12 05:06:49,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,200 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,220 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,226 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:06:49,234 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:06:49,235 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:06:49,235 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:06:49,235 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (1/1) ... [2024-11-12 05:06:49,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:06:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:06:49,265 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:06:49,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:06:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:06:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:06:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:06:49,318 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:06:49,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:06:49,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:06:49,399 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:06:49,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:07:03,679 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-12 05:07:03,679 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:07:03,696 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:07:03,697 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:07:03,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:03 BoogieIcfgContainer [2024-11-12 05:07:03,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:07:03,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:07:03,701 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:07:03,704 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:07:03,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:06:48" (1/3) ... [2024-11-12 05:07:03,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f92651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:03, skipping insertion in model container [2024-11-12 05:07:03,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:06:49" (2/3) ... [2024-11-12 05:07:03,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f92651 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:07:03, skipping insertion in model container [2024-11-12 05:07:03,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:07:03" (3/3) ... [2024-11-12 05:07:03,708 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-15.i [2024-11-12 05:07:03,721 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:07:03,722 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:07:03,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:07:03,775 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;@50d8a761, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:07:03,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:07:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:07:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:07:03,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:03,823 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:03,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:03,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -895587004, now seen corresponding path program 1 times [2024-11-12 05:07:03,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:07:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27539036] [2024-11-12 05:07:03,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:03,860 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-11-12 05:07:03,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:07:03,863 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:07:03,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:07:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:04,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:07:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:07:04,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-12 05:07:04,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:07:04,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:07:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27539036] [2024-11-12 05:07:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27539036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:07:04,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761655240] [2024-11-12 05:07:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:07:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:07:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:07:04,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:07:04,610 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-12 05:07:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:04,643 INFO L93 Difference]: Finished difference Result 169 states and 296 transitions. [2024-11-12 05:07:04,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:07:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 180 [2024-11-12 05:07:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:04,653 INFO L225 Difference]: With dead ends: 169 [2024-11-12 05:07:04,654 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 05:07:04,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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-11-12 05:07:04,660 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:04,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:07:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 05:07:04,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-12 05:07:04,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 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-11-12 05:07:04,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 130 transitions. [2024-11-12 05:07:04,710 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 130 transitions. Word has length 180 [2024-11-12 05:07:04,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:04,712 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 130 transitions. [2024-11-12 05:07:04,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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-11-12 05:07:04,712 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 130 transitions. [2024-11-12 05:07:04,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:07:04,716 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:04,716 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:04,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 05:07:04,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:07:04,917 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:04,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:04,919 INFO L85 PathProgramCache]: Analyzing trace with hash -541218100, now seen corresponding path program 1 times [2024-11-12 05:07:04,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:07:04,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345189953] [2024-11-12 05:07:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:04,921 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-11-12 05:07:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:07:04,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:07:04,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:07:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:05,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 05:07:05,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:07:05,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-12 05:07:05,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:07:05,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:07:05,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345189953] [2024-11-12 05:07:05,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345189953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:07:05,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:07:05,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:07:05,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14501241] [2024-11-12 05:07:05,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:07:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:07:05,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:07:05,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:07:05,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:07:05,754 INFO L87 Difference]: Start difference. First operand 84 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:07:10,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:07:14,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 05:07:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:07:14,863 INFO L93 Difference]: Finished difference Result 241 states and 374 transitions. [2024-11-12 05:07:14,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:07:14,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-12 05:07:14,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:07:14,876 INFO L225 Difference]: With dead ends: 241 [2024-11-12 05:07:14,877 INFO L226 Difference]: Without dead ends: 160 [2024-11-12 05:07:14,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:07:14,878 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 111 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:07:14,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 344 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-12 05:07:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-12 05:07:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 101. [2024-11-12 05:07:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 71 states have internal predecessors, (99), 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-11-12 05:07:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-11-12 05:07:14,891 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 180 [2024-11-12 05:07:14,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:07:14,892 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-11-12 05:07:14,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-12 05:07:14,892 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-11-12 05:07:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-12 05:07:14,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:07:14,894 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:07:14,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 05:07:15,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:07:15,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:07:15,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:07:15,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2129566002, now seen corresponding path program 1 times [2024-11-12 05:07:15,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:07:15,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256289117] [2024-11-12 05:07:15,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:07:15,104 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-11-12 05:07:15,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:07:15,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:07:15,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 05:07:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:07:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 05:07:15,992 INFO L279 TraceCheckSpWp]: Computing forward predicates...