./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_50-while_file-99.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 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:02:12,351 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:02:12,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:02:12,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:02:12,405 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:02:12,426 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:02:12,428 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:02:12,428 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:02:12,428 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:02:12,428 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:02:12,429 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:02:12,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:02:12,430 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:02:12,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:02:12,431 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:02:12,431 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:02:12,431 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:02:12,431 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:02:12,431 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:02:12,431 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:12,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:02:12,432 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:02:12,433 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 [2025-03-08 15:02:12,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:02:12,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:02:12,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:02:12,665 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:02:12,666 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:02:12,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:13,769 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab4688b/8160193d11284f1281ab47289d157b1a/FLAG2115fd360 [2025-03-08 15:02:13,997 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:02:13,997 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:14,004 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab4688b/8160193d11284f1281ab47289d157b1a/FLAG2115fd360 [2025-03-08 15:02:14,015 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4fab4688b/8160193d11284f1281ab47289d157b1a [2025-03-08 15:02:14,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:02:14,018 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:02:14,019 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:14,019 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:02:14,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:02:14,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,022 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14, skipping insertion in model container [2025-03-08 15:02:14,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:02:14,116 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_50-while_file-99.i[915,928] [2025-03-08 15:02:14,152 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:14,158 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:02:14,164 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_50-while_file-99.i[915,928] [2025-03-08 15:02:14,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:14,193 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:02:14,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14 WrapperNode [2025-03-08 15:02:14,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:14,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:14,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:02:14,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:02:14,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,212 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,240 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-08 15:02:14,240 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:14,241 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:02:14,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:02:14,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:02:14,248 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,248 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,268 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]. [2025-03-08 15:02:14,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,268 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,284 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,288 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,291 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:02:14,291 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:02:14,291 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:02:14,292 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:02:14,293 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (1/1) ... [2025-03-08 15:02:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:14,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:14,318 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) [2025-03-08 15:02:14,323 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 [2025-03-08 15:02:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:02:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:02:14,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:02:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:02:14,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:02:14,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:02:14,390 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:02:14,392 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:02:14,689 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L138: havoc property_#t~bitwise21#1;havoc property_#t~short22#1; [2025-03-08 15:02:14,714 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 15:02:14,715 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:02:14,731 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:02:14,732 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:02:14,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:14 BoogieIcfgContainer [2025-03-08 15:02:14,732 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:02:14,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:02:14,736 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:02:14,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:02:14,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:02:14" (1/3) ... [2025-03-08 15:02:14,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b3653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:14, skipping insertion in model container [2025-03-08 15:02:14,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:14" (2/3) ... [2025-03-08 15:02:14,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b3653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:14, skipping insertion in model container [2025-03-08 15:02:14,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:14" (3/3) ... [2025-03-08 15:02:14,742 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:14,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:02:14,753 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-99.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:02:14,800 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:02:14,810 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;@5548713c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:02:14,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:02:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:14,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 15:02:14,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:14,825 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:14,825 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:14,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:14,829 INFO L85 PathProgramCache]: Analyzing trace with hash 2137971732, now seen corresponding path program 1 times [2025-03-08 15:02:14,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:14,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40543158] [2025-03-08 15:02:14,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:14,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:14,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:14,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:14,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:14,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 15:02:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40543158] [2025-03-08 15:02:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40543158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:02:15,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255069688] [2025-03-08 15:02:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:15,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:15,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:15,120 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) [2025-03-08 15:02:15,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:02:15,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:15,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:15,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:15,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:15,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:02:15,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-03-08 15:02:15,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255069688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:02:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:02:15,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481112241] [2025-03-08 15:02:15,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:15,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:02:15,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:15,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:02:15,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:15,351 INFO L87 Difference]: Start difference. First operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 15:02:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:15,379 INFO L93 Difference]: Finished difference Result 168 states and 290 transitions. [2025-03-08 15:02:15,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:02:15,381 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2025-03-08 15:02:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:15,386 INFO L225 Difference]: With dead ends: 168 [2025-03-08 15:02:15,386 INFO L226 Difference]: Without dead ends: 84 [2025-03-08 15:02:15,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:15,390 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:15,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:02:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-08 15:02:15,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-08 15:02:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 128 transitions. [2025-03-08 15:02:15,424 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 128 transitions. Word has length 183 [2025-03-08 15:02:15,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:15,425 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 128 transitions. [2025-03-08 15:02:15,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 15:02:15,425 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 128 transitions. [2025-03-08 15:02:15,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 15:02:15,430 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:15,430 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:15,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 15:02:15,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:02:15,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:15,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1938602129, now seen corresponding path program 1 times [2025-03-08 15:02:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895882485] [2025-03-08 15:02:15,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:15,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:15,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:15,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:15,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:16,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 141 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2025-03-08 15:02:16,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:02:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895882485] [2025-03-08 15:02:16,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895882485] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:02:16,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777805261] [2025-03-08 15:02:16,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:16,635 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:02:16,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:02:16,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:16,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 15:02:16,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2025-03-08 15:02:17,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:02:17,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-08 15:02:17,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777805261] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:02:17,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:02:17,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-03-08 15:02:17,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466392277] [2025-03-08 15:02:17,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:02:17,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-08 15:02:17,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:02:17,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-08 15:02:17,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 15:02:17,945 INFO L87 Difference]: Start difference. First operand 84 states and 128 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-08 15:02:18,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:18,781 INFO L93 Difference]: Finished difference Result 363 states and 528 transitions. [2025-03-08 15:02:18,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-08 15:02:18,782 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 183 [2025-03-08 15:02:18,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:18,785 INFO L225 Difference]: With dead ends: 363 [2025-03-08 15:02:18,786 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 15:02:18,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2025-03-08 15:02:18,790 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 486 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:18,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 464 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:02:18,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 15:02:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 94. [2025-03-08 15:02:18,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.2622950819672132) internal successors, (77), 61 states have internal predecessors, (77), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:18,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2025-03-08 15:02:18,824 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 183 [2025-03-08 15:02:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:18,824 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2025-03-08 15:02:18,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2025-03-08 15:02:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2025-03-08 15:02:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 15:02:18,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:18,826 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:18,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:02:19,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 15:02:19,027 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1433043504, now seen corresponding path program 1 times [2025-03-08 15:02:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:02:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380360781] [2025-03-08 15:02:19,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:19,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:02:19,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:19,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:19,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:19,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 15:02:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111948545] [2025-03-08 15:02:19,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:19,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:19,169 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:02:19,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:02:19,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:19,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:19,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:19,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:02:19,251 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 15:02:19,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 15:02:19,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 15:02:19,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:19,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 15:02:19,362 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 15:02:19,363 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 15:02:19,363 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 15:02:19,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 15:02:19,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:02:19,568 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-08 15:02:19,648 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 15:02:19,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 03:02:19 BoogieIcfgContainer [2025-03-08 15:02:19,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 15:02:19,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 15:02:19,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 15:02:19,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 15:02:19,652 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:14" (3/4) ... [2025-03-08 15:02:19,653 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 15:02:19,654 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 15:02:19,655 INFO L158 Benchmark]: Toolchain (without parser) took 5636.92ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 124.0MB in the beginning and 281.4MB in the end (delta: -157.3MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2025-03-08 15:02:19,655 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:19,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.17ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 15:02:19,656 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 106.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:19,657 INFO L158 Benchmark]: Boogie Preprocessor took 50.12ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:02:19,657 INFO L158 Benchmark]: IcfgBuilder took 441.02ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 75.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 15:02:19,657 INFO L158 Benchmark]: TraceAbstraction took 4915.44ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 74.5MB in the beginning and 282.5MB in the end (delta: -208.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 15:02:19,657 INFO L158 Benchmark]: Witness Printer took 2.96ms. Allocated memory is still 369.1MB. Free memory was 281.4MB in the beginning and 281.4MB in the end (delta: 72.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 15:02:19,658 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.19ms. Allocated memory is still 201.3MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 175.17ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 109.4MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 106.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.12ms. Allocated memory is still 167.8MB. Free memory was 106.0MB in the beginning and 100.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 441.02ms. Allocated memory is still 167.8MB. Free memory was 100.4MB in the beginning and 75.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4915.44ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 74.5MB in the beginning and 282.5MB in the end (delta: -208.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.96ms. Allocated memory is still 369.1MB. Free memory was 281.4MB in the beginning and 281.4MB in the end (delta: 72.1kB). Peak memory consumption was 8.4MB. 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 someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 138, overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] signed long int var_1_6 = 25; [L28] double var_1_10 = 99999999999.25; [L29] double var_1_11 = 255.25; [L30] double var_1_12 = 1.125; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 5; [L33] unsigned char var_1_15 = 32; [L34] unsigned char var_1_16 = 4; [L35] unsigned char var_1_17 = 2; [L36] signed char var_1_18 = 4; [L37] signed char var_1_19 = 16; [L38] signed char var_1_20 = 32; [L39] signed char var_1_21 = 25; [L40] signed char var_1_22 = 1; [L41] signed char var_1_23 = 100; [L42] double var_1_24 = 3.125; [L43] double var_1_25 = 0.0; [L44] unsigned short int var_1_26 = 32; [L45] unsigned short int var_1_27 = 36217; [L46] unsigned char var_1_28 = 2; VAL [isInitial=0, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L142] isInitial = 1 [L143] FCALL initially() [L144] COND TRUE 1 [L145] FCALL updateLastVariables() [L146] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_4=0, var_1_5=0, var_1_6=25] [L94] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L94] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_5=0, var_1_6=25] [L97] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L97] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_6=25] [L100] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L100] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_11=1021/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L101] var_1_11 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L102] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_12=9/8, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L103] var_1_12 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L104] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=5, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L105] var_1_14 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L106] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L107] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=4, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L108] var_1_16 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L109] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L110] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=2, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L111] var_1_17 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L112] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L113] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=16, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L114] var_1_19 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L115] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L116] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=32, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L117] var_1_20 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L118] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L119] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=25, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L120] var_1_21 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_21 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L121] RET assume_abort_if_not(var_1_21 >= -63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L122] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L123] var_1_22 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L124] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L125] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=100, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L126] var_1_23 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L127] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L128] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_25=0, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L129] var_1_25 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L130] RET assume_abort_if_not((var_1_25 >= 4611686.018427382800e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=36217, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L131] var_1_27 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_27 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L132] RET assume_abort_if_not(var_1_27 >= 32767) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] CALL assume_abort_if_not(var_1_27 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L133] RET assume_abort_if_not(var_1_27 <= 65534) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L146] RET updateVariables() [L147] CALL step() [L50] COND TRUE \read(var_1_2) [L51] var_1_1 = (var_1_3 || var_1_4) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=32, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L55] COND TRUE ! var_1_5 [L56] var_1_15 = (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=4, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L58] var_1_18 = ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23)))) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L59] COND FALSE !(\read(var_1_1)) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=2, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=25] [L62] var_1_28 = var_1_16 [L63] var_1_6 = ((var_1_28 - var_1_26) + var_1_26) VAL [isInitial=1, var_1_10=399999999997/4, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L64] COND FALSE !(var_1_26 < (var_1_6 * var_1_28)) [L71] var_1_10 = var_1_12 VAL [isInitial=1, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L73] signed long int stepLocal_0 = - var_1_26; VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L74] COND TRUE var_1_12 != var_1_10 [L75] var_1_13 = var_1_14 VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L83] signed char stepLocal_1 = var_1_23; VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] EXPR var_1_20 ^ var_1_28 VAL [isInitial=1, stepLocal_0=-32, stepLocal_1=0, var_1_10=2, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=25/8, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L84] COND TRUE stepLocal_1 >= (var_1_20 ^ var_1_28) [L85] var_1_24 = ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))) VAL [isInitial=1, stepLocal_0=-32, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L147] RET step() [L148] CALL, EXPR property() [L138] EXPR ((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L138-L139] return ((((((((var_1_2 ? (var_1_1 == ((unsigned char) (var_1_3 || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 || (var_1_4 || var_1_5))))) && (var_1_6 == ((signed long int) ((var_1_28 - var_1_26) + var_1_26)))) && ((var_1_26 < (var_1_6 * var_1_28)) ? (var_1_3 ? ((var_1_26 <= var_1_6) ? (var_1_10 == ((double) (var_1_11 - var_1_12))) : 1) : 1) : (var_1_10 == ((double) var_1_12)))) && ((var_1_12 != var_1_10) ? (var_1_13 == ((unsigned char) var_1_14)) : (((- var_1_26) > var_1_14) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) 25))))) && ((! var_1_5) ? (var_1_15 == ((unsigned char) (((((var_1_16 + var_1_17)) > (var_1_14)) ? ((var_1_16 + var_1_17)) : (var_1_14))))) : 1)) && (var_1_18 == ((signed char) ((((((var_1_19 - var_1_20) + var_1_21)) > ((var_1_22 - var_1_23))) ? (((var_1_19 - var_1_20) + var_1_21)) : ((var_1_22 - var_1_23))))))) && ((var_1_23 >= (var_1_20 ^ var_1_28)) ? (var_1_24 == ((double) ((((((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) > (((var_1_25 - 25.5) - 127.125))) ? (((((var_1_12) < (var_1_11)) ? (var_1_12) : (var_1_11)))) : (((var_1_25 - 25.5) - 127.125)))))) : 1)) && (var_1_1 ? (var_1_26 == ((unsigned short int) ((((((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) < ((var_1_27 - var_1_17))) ? (((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) : ((var_1_27 - var_1_17)))))) : 1)) && (var_1_28 == ((unsigned char) var_1_16)) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=0, var_1_12=2, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=0, var_1_24=2, var_1_26=32, var_1_27=32767, var_1_28=0, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 87 locations, 162 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 3, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 515 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 590 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 330 mSDsCounter, 159 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 517 IncrementalHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 159 mSolverCounterUnsat, 260 mSDtfsCounter, 517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 547 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=2, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 188 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1098 NumberOfCodeBlocks, 1098 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 910 ConstructedInterpolants, 0 QuantifiedInterpolants, 3211 SizeOfPredicates, 4 NumberOfNonLiveVariables, 816 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 7638/8120 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 15:02:19,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_50-while_file-99.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 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:02:21,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:02:21,587 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 15:02:21,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:02:21,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:02:21,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:02:21,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:02:21,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:02:21,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:02:21,621 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:02:21,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:02:21,622 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:02:21,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:02:21,623 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:02:21,623 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:02:21,623 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:02:21,623 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:02:21,623 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:02:21,623 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:02:21,624 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:02:21,625 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:02:21,625 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:02:21,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:02:21,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:02:21,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:02:21,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:21,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:02:21,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 9704c260bb320bd8ff033a8e82239ebc7c1dec84cc605a8d02c980829b53fa09 [2025-03-08 15:02:21,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:02:21,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:02:21,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:02:21,883 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:02:21,883 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:02:21,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:23,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08739b701/846e2579b3a74665a6372fb7f7c6b89d/FLAG1dff6eb60 [2025-03-08 15:02:23,292 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:02:23,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:23,300 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08739b701/846e2579b3a74665a6372fb7f7c6b89d/FLAG1dff6eb60 [2025-03-08 15:02:23,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08739b701/846e2579b3a74665a6372fb7f7c6b89d [2025-03-08 15:02:23,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:02:23,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:02:23,320 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:23,320 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:02:23,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:02:23,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b88d5d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23, skipping insertion in model container [2025-03-08 15:02:23,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:02:23,444 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_50-while_file-99.i[915,928] [2025-03-08 15:02:23,493 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:23,508 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:02:23,517 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_50-while_file-99.i[915,928] [2025-03-08 15:02:23,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:02:23,571 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:02:23,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23 WrapperNode [2025-03-08 15:02:23,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:02:23,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:23,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:02:23,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:02:23,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,586 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,614 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2025-03-08 15:02:23,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:02:23,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:02:23,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:02:23,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:02:23,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,634 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]. [2025-03-08 15:02:23,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:02:23,645 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:02:23,645 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:02:23,645 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:02:23,646 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (1/1) ... [2025-03-08 15:02:23,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:02:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:02:23,678 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) [2025-03-08 15:02:23,681 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 [2025-03-08 15:02:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:02:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 15:02:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:02:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:02:23,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:02:23,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:02:23,766 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:02:23,768 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:02:26,626 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 15:02:26,626 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:02:26,634 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:02:26,634 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:02:26,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:26 BoogieIcfgContainer [2025-03-08 15:02:26,634 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:02:26,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:02:26,636 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:02:26,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:02:26,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:02:23" (1/3) ... [2025-03-08 15:02:26,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71de0aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:26, skipping insertion in model container [2025-03-08 15:02:26,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:02:23" (2/3) ... [2025-03-08 15:02:26,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71de0aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:02:26, skipping insertion in model container [2025-03-08 15:02:26,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:02:26" (3/3) ... [2025-03-08 15:02:26,644 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-while_file-99.i [2025-03-08 15:02:26,653 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:02:26,655 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-while_file-99.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:02:26,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:02:26,703 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;@74c10006, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:02:26,703 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:02:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 15:02:26,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:26,715 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:26,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:26,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1586777251, now seen corresponding path program 1 times [2025-03-08 15:02:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:26,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87739934] [2025-03-08 15:02:26,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:26,727 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 [2025-03-08 15:02:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:26,729 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) [2025-03-08 15:02:26,730 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 [2025-03-08 15:02:26,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 15:02:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 15:02:27,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:27,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:27,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:02:27,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-03-08 15:02:27,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:27,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:27,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87739934] [2025-03-08 15:02:27,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87739934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:27,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:27,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 15:02:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650114523] [2025-03-08 15:02:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:27,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:02:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:27,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:02:27,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:02:27,095 INFO L87 Difference]: Start difference. First operand has 76 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 15:02:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:27,111 INFO L93 Difference]: Finished difference Result 146 states and 254 transitions. [2025-03-08 15:02:27,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:02:27,112 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 180 [2025-03-08 15:02:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:27,116 INFO L225 Difference]: With dead ends: 146 [2025-03-08 15:02:27,116 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 15:02:27,119 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 [2025-03-08 15:02:27,120 INFO L435 NwaCegarLoop]: 110 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, 110 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 [2025-03-08 15:02:27,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:02:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 15:02:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 15:02:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:27,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2025-03-08 15:02:27,155 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 180 [2025-03-08 15:02:27,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:27,156 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2025-03-08 15:02:27,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-03-08 15:02:27,157 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2025-03-08 15:02:27,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 15:02:27,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:27,161 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:27,173 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 [2025-03-08 15:02:27,362 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 [2025-03-08 15:02:27,362 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1929967290, now seen corresponding path program 1 times [2025-03-08 15:02:27,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:27,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863810634] [2025-03-08 15:02:27,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:27,364 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 [2025-03-08 15:02:27,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:27,366 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) [2025-03-08 15:02:27,367 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 [2025-03-08 15:02:27,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 15:02:27,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 15:02:27,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:27,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:27,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:02:27,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:28,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 455 proven. 141 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2025-03-08 15:02:28,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:02:29,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 21 proven. 144 refuted. 0 times theorem prover too weak. 1459 trivial. 0 not checked. [2025-03-08 15:02:29,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:29,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863810634] [2025-03-08 15:02:29,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863810634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:02:29,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:02:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2025-03-08 15:02:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431005387] [2025-03-08 15:02:29,352 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:02:29,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:02:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:29,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:02:29,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:02:29,354 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-08 15:02:32,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:02:32,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:32,959 INFO L93 Difference]: Finished difference Result 239 states and 344 transitions. [2025-03-08 15:02:32,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-08 15:02:32,959 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 180 [2025-03-08 15:02:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:32,961 INFO L225 Difference]: With dead ends: 239 [2025-03-08 15:02:32,961 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 15:02:32,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=741, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 15:02:32,963 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 108 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:32,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 15:02:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 15:02:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 83. [2025-03-08 15:02:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-08 15:02:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-03-08 15:02:32,980 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 180 [2025-03-08 15:02:32,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:32,980 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-03-08 15:02:32,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2025-03-08 15:02:32,981 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-03-08 15:02:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-08 15:02:32,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:32,983 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:32,994 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 [2025-03-08 15:02:33,184 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 [2025-03-08 15:02:33,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:33,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash 568048647, now seen corresponding path program 1 times [2025-03-08 15:02:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909095850] [2025-03-08 15:02:33,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:33,186 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 [2025-03-08 15:02:33,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:33,188 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) [2025-03-08 15:02:33,189 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 [2025-03-08 15:02:33,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-08 15:02:33,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-08 15:02:33,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:33,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:33,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:02:33,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 760 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2025-03-08 15:02:34,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:02:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 27 proven. 57 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-03-08 15:02:35,415 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:35,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909095850] [2025-03-08 15:02:35,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909095850] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:02:35,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 15:02:35,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-08 15:02:35,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115666841] [2025-03-08 15:02:35,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 15:02:35,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 15:02:35,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:35,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 15:02:35,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-03-08 15:02:35,418 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-08 15:02:39,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:02:40,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:40,006 INFO L93 Difference]: Finished difference Result 217 states and 292 transitions. [2025-03-08 15:02:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 15:02:40,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 180 [2025-03-08 15:02:40,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:40,009 INFO L225 Difference]: With dead ends: 217 [2025-03-08 15:02:40,009 INFO L226 Difference]: Without dead ends: 137 [2025-03-08 15:02:40,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2025-03-08 15:02:40,010 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 119 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:40,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 259 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 15:02:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-08 15:02:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 122. [2025-03-08 15:02:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 76 states have (on average 1.144736842105263) internal successors, (87), 77 states have internal predecessors, (87), 38 states have call successors, (38), 7 states have call predecessors, (38), 7 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-08 15:02:40,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 163 transitions. [2025-03-08 15:02:40,026 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 163 transitions. Word has length 180 [2025-03-08 15:02:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:40,026 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 163 transitions. [2025-03-08 15:02:40,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 4 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) [2025-03-08 15:02:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 163 transitions. [2025-03-08 15:02:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:02:40,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:40,031 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:40,042 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 (4)] Ended with exit code 0 [2025-03-08 15:02:40,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 [2025-03-08 15:02:40,232 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:40,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:40,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1098613988, now seen corresponding path program 1 times [2025-03-08 15:02:40,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:40,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541888703] [2025-03-08 15:02:40,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:40,233 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 [2025-03-08 15:02:40,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:40,235 INFO L229 MonitoredProcess]: Starting monitored process 5 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) [2025-03-08 15:02:40,236 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 (5)] Waiting until timeout for monitored process [2025-03-08 15:02:40,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:02:40,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:02:40,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:40,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:40,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 15:02:40,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:02:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-03-08 15:02:41,240 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:02:41,240 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 15:02:41,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541888703] [2025-03-08 15:02:41,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541888703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:02:41,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:02:41,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:02:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170908154] [2025-03-08 15:02:41,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:02:41,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:02:41,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 15:02:41,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:02:41,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:02:41,241 INFO L87 Difference]: Start difference. First operand 122 states and 163 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 15:02:42,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 15:02:43,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:02:43,037 INFO L93 Difference]: Finished difference Result 360 states and 483 transitions. [2025-03-08 15:02:43,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:02:43,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 181 [2025-03-08 15:02:43,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:02:43,062 INFO L225 Difference]: With dead ends: 360 [2025-03-08 15:02:43,062 INFO L226 Difference]: Without dead ends: 241 [2025-03-08 15:02:43,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:02:43,063 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 21 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:02:43,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 301 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-08 15:02:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-08 15:02:43,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2025-03-08 15:02:43,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.1418918918918919) internal successors, (169), 150 states have internal predecessors, (169), 76 states have call successors, (76), 14 states have call predecessors, (76), 14 states have return successors, (76), 74 states have call predecessors, (76), 76 states have call successors, (76) [2025-03-08 15:02:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 321 transitions. [2025-03-08 15:02:43,091 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 321 transitions. Word has length 181 [2025-03-08 15:02:43,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:02:43,092 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 321 transitions. [2025-03-08 15:02:43,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-03-08 15:02:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 321 transitions. [2025-03-08 15:02:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 15:02:43,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:02:43,095 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 15:02:43,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:02:43,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 [2025-03-08 15:02:43,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:02:43,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:02:43,296 INFO L85 PathProgramCache]: Analyzing trace with hash -211110307, now seen corresponding path program 1 times [2025-03-08 15:02:43,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 15:02:43,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35672710] [2025-03-08 15:02:43,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:02:43,296 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 [2025-03-08 15:02:43,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 15:02:43,300 INFO L229 MonitoredProcess]: Starting monitored process 6 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) [2025-03-08 15:02:43,301 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 (6)] Waiting until timeout for monitored process [2025-03-08 15:02:43,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 15:02:43,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 15:02:43,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:02:43,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:02:43,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 15:02:43,858 INFO L279 TraceCheckSpWp]: Computing forward predicates...