./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercode_fillercodesize_ps-cn-10_file-35.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 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:35:14,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:35:14,460 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 19:35:14,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:35:14,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:35:14,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:35:14,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:35:14,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:35:14,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:35:14,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:35:14,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:35:14,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:35:14,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:35:14,520 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:35:14,520 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:35:14,521 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:35:14,521 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:35:14,522 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:14,522 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 19:35:14,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 19:35:14,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:35:14,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:35:14,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:35:14,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:35:14,523 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 -> 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 [2025-03-03 19:35:14,725 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:35:14,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:35:14,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:35:14,735 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:35:14,735 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:35:14,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:15,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fcc1096/6a1921b0dbd8478ea0eaca807c475be7/FLAGd22cd0408 [2025-03-03 19:35:16,061 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:35:16,062 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:16,075 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fcc1096/6a1921b0dbd8478ea0eaca807c475be7/FLAGd22cd0408 [2025-03-03 19:35:16,400 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7fcc1096/6a1921b0dbd8478ea0eaca807c475be7 [2025-03-03 19:35:16,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:35:16,403 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:35:16,404 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:16,404 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:35:16,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:35:16,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1836331b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16, skipping insertion in model container [2025-03-03 19:35:16,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:35:16,520 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_fillercode_fillercodesize_ps-cn-10_file-35.i[915,928] [2025-03-03 19:35:16,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:16,566 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:35:16,572 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_fillercode_fillercodesize_ps-cn-10_file-35.i[915,928] [2025-03-03 19:35:16,589 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:16,604 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:35:16,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16 WrapperNode [2025-03-03 19:35:16,605 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:16,606 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:16,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:35:16,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:35:16,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,618 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,636 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2025-03-03 19:35:16,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:16,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:35:16,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:35:16,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:35:16,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,644 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,652 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-03 19:35:16,652 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,652 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,661 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:35:16,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:35:16,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:35:16,664 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:35:16,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (1/1) ... [2025-03-03 19:35:16,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:16,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:16,691 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-03 19:35:16,696 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-03 19:35:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:35:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:35:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:35:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 19:35:16,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:35:16,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:35:16,776 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:35:16,777 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:35:16,987 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2025-03-03 19:35:17,023 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 19:35:17,023 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:35:17,034 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:35:17,034 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:35:17,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:17 BoogieIcfgContainer [2025-03-03 19:35:17,035 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:35:17,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:35:17,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:35:17,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:35:17,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:35:16" (1/3) ... [2025-03-03 19:35:17,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bac1fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:17, skipping insertion in model container [2025-03-03 19:35:17,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:16" (2/3) ... [2025-03-03 19:35:17,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bac1fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:17, skipping insertion in model container [2025-03-03 19:35:17,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:17" (3/3) ... [2025-03-03 19:35:17,042 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:17,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:35:17,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:35:17,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:35:17,106 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;@70744371, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:35:17,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:35:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:35:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:35:17,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:17,119 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:17,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:17,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1690169111, now seen corresponding path program 1 times [2025-03-03 19:35:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:17,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789249689] [2025-03-03 19:35:17,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:17,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:35:17,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:35:17,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:17,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 19:35:17,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:17,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789249689] [2025-03-03 19:35:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789249689] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 19:35:17,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803169301] [2025-03-03 19:35:17,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:17,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:17,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:17,418 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-03 19:35:17,420 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-03 19:35:17,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:35:17,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:35:17,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:17,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:17,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:35:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:17,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2025-03-03 19:35:17,612 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:17,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803169301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:17,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 19:35:17,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 19:35:17,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015142371] [2025-03-03 19:35:17,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:17,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:35:17,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:17,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:35:17,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:35:17,633 INFO L87 Difference]: Start difference. First operand has 84 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:35:17,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:17,655 INFO L93 Difference]: Finished difference Result 162 states and 270 transitions. [2025-03-03 19:35:17,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:35:17,658 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2025-03-03 19:35:17,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:17,662 INFO L225 Difference]: With dead ends: 162 [2025-03-03 19:35:17,663 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 19:35:17,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 168 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-03 19:35:17,667 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:17,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:35:17,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 19:35:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-03 19:35:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 54 states have internal predecessors, (70), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:35:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 120 transitions. [2025-03-03 19:35:17,696 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 120 transitions. Word has length 167 [2025-03-03 19:35:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:17,696 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 120 transitions. [2025-03-03 19:35:17,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:35:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 120 transitions. [2025-03-03 19:35:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 19:35:17,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:17,701 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:17,707 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-03 19:35:17,902 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-03 19:35:17,902 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:17,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:17,902 INFO L85 PathProgramCache]: Analyzing trace with hash -40741164, now seen corresponding path program 1 times [2025-03-03 19:35:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:17,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539621448] [2025-03-03 19:35:17,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:17,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:17,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 19:35:17,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 19:35:17,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:17,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:18,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:18,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:18,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539621448] [2025-03-03 19:35:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539621448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:35:18,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589319075] [2025-03-03 19:35:18,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:18,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:35:18,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:18,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:35:18,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:18,325 INFO L87 Difference]: Start difference. First operand 81 states and 120 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:18,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:18,540 INFO L93 Difference]: Finished difference Result 257 states and 381 transitions. [2025-03-03 19:35:18,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:35:18,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2025-03-03 19:35:18,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:18,542 INFO L225 Difference]: With dead ends: 257 [2025-03-03 19:35:18,544 INFO L226 Difference]: Without dead ends: 179 [2025-03-03 19:35:18,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:35:18,545 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:18,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 426 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:35:18,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-03-03 19:35:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157. [2025-03-03 19:35:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 19:35:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 235 transitions. [2025-03-03 19:35:18,571 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 235 transitions. Word has length 167 [2025-03-03 19:35:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:18,571 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 235 transitions. [2025-03-03 19:35:18,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:18,574 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 235 transitions. [2025-03-03 19:35:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:35:18,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:18,576 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:18,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 19:35:18,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:18,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -861944935, now seen corresponding path program 1 times [2025-03-03 19:35:18,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:18,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400128987] [2025-03-03 19:35:18,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:18,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:18,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:18,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:18,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:18,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400128987] [2025-03-03 19:35:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400128987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:18,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:18,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:35:18,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348574074] [2025-03-03 19:35:18,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:18,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:35:18,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:18,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:35:18,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:35:18,897 INFO L87 Difference]: Start difference. First operand 157 states and 235 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:19,045 INFO L93 Difference]: Finished difference Result 493 states and 736 transitions. [2025-03-03 19:35:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:35:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 19:35:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:19,049 INFO L225 Difference]: With dead ends: 493 [2025-03-03 19:35:19,052 INFO L226 Difference]: Without dead ends: 339 [2025-03-03 19:35:19,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-03 19:35:19,053 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 112 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:19,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 350 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:35:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-03 19:35:19,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 309. [2025-03-03 19:35:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 204 states have internal predecessors, (264), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:35:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 464 transitions. [2025-03-03 19:35:19,098 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 464 transitions. Word has length 168 [2025-03-03 19:35:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:19,098 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 464 transitions. [2025-03-03 19:35:19,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 464 transitions. [2025-03-03 19:35:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:35:19,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:19,100 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:19,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 19:35:19,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:19,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:19,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1706416806, now seen corresponding path program 1 times [2025-03-03 19:35:19,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285626549] [2025-03-03 19:35:19,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:19,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:19,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:19,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:19,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:19,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:19,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:19,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285626549] [2025-03-03 19:35:19,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285626549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:19,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:19,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:35:19,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839359520] [2025-03-03 19:35:19,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:19,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:35:19,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:19,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:35:19,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:35:19,340 INFO L87 Difference]: Start difference. First operand 309 states and 464 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:19,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:19,574 INFO L93 Difference]: Finished difference Result 1049 states and 1567 transitions. [2025-03-03 19:35:19,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:35:19,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 19:35:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:19,584 INFO L225 Difference]: With dead ends: 1049 [2025-03-03 19:35:19,584 INFO L226 Difference]: Without dead ends: 743 [2025-03-03 19:35:19,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:35:19,586 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 158 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:19,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 375 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 19:35:19,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-03 19:35:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 487. [2025-03-03 19:35:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 350 states have (on average 1.3314285714285714) internal successors, (466), 354 states have internal predecessors, (466), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 19:35:19,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 722 transitions. [2025-03-03 19:35:19,671 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 722 transitions. Word has length 168 [2025-03-03 19:35:19,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:19,672 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 722 transitions. [2025-03-03 19:35:19,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 722 transitions. [2025-03-03 19:35:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:35:19,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:19,675 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:19,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 19:35:19,676 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:19,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1999819813, now seen corresponding path program 1 times [2025-03-03 19:35:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195362729] [2025-03-03 19:35:19,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:19,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:19,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:19,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:19,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:19,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 19:35:19,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195362729] [2025-03-03 19:35:19,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195362729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:19,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:19,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 19:35:19,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966475428] [2025-03-03 19:35:19,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:19,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:35:19,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 19:35:19,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:35:19,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:19,921 INFO L87 Difference]: Start difference. First operand 487 states and 722 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:20,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:20,150 INFO L93 Difference]: Finished difference Result 914 states and 1321 transitions. [2025-03-03 19:35:20,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:35:20,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2025-03-03 19:35:20,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:20,156 INFO L225 Difference]: With dead ends: 914 [2025-03-03 19:35:20,158 INFO L226 Difference]: Without dead ends: 671 [2025-03-03 19:35:20,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:35:20,160 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 107 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:20,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 446 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 19:35:20,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2025-03-03 19:35:20,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 487. [2025-03-03 19:35:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 350 states have (on average 1.32) internal successors, (462), 354 states have internal predecessors, (462), 128 states have call successors, (128), 8 states have call predecessors, (128), 8 states have return successors, (128), 124 states have call predecessors, (128), 128 states have call successors, (128) [2025-03-03 19:35:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 718 transitions. [2025-03-03 19:35:20,202 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 718 transitions. Word has length 168 [2025-03-03 19:35:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:20,203 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 718 transitions. [2025-03-03 19:35:20,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 718 transitions. [2025-03-03 19:35:20,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 19:35:20,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:20,204 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:20,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 19:35:20,204 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:20,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:20,205 INFO L85 PathProgramCache]: Analyzing trace with hash 487693020, now seen corresponding path program 1 times [2025-03-03 19:35:20,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 19:35:20,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74658785] [2025-03-03 19:35:20,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:20,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 19:35:20,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:20,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:20,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:20,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 19:35:20,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470992438] [2025-03-03 19:35:20,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 19:35:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:20,280 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-03 19:35:20,282 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-03 19:35:20,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:20,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:20,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:20,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:35:20,405 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 19:35:20,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 19:35:20,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 19:35:20,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 19:35:20,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 19:35:20,535 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 19:35:20,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 19:35:20,544 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-03 19:35:20,737 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,SelfDestructingSolverStorable5 [2025-03-03 19:35:20,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-03 19:35:20,823 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 19:35:20,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 07:35:20 BoogieIcfgContainer [2025-03-03 19:35:20,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 19:35:20,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 19:35:20,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 19:35:20,825 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 19:35:20,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:17" (3/4) ... [2025-03-03 19:35:20,828 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 19:35:20,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 19:35:20,829 INFO L158 Benchmark]: Toolchain (without parser) took 4426.28ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 113.6MB in the beginning and 169.8MB in the end (delta: -56.2MB). Peak memory consumption was 199.1MB. Max. memory is 16.1GB. [2025-03-03 19:35:20,830 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:35:20,830 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.17ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 99.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 19:35:20,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.01ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:35:20,831 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:35:20,831 INFO L158 Benchmark]: IcfgBuilder took 371.32ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 19:35:20,831 INFO L158 Benchmark]: TraceAbstraction took 3788.63ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.9MB in the beginning and 169.9MB in the end (delta: -101.0MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. [2025-03-03 19:35:20,831 INFO L158 Benchmark]: Witness Printer took 3.49ms. Allocated memory is still 402.7MB. Free memory was 169.9MB in the beginning and 169.8MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 19:35:20,832 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.13ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.17ms. Allocated memory is still 142.6MB. Free memory was 113.6MB in the beginning and 99.0MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.01ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.3MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.00ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 93.1MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 371.32ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 69.3MB in the end (delta: 23.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3788.63ms. Allocated memory was 142.6MB in the beginning and 402.7MB in the end (delta: 260.0MB). Free memory was 68.9MB in the beginning and 169.9MB in the end (delta: -101.0MB). Peak memory consumption was 165.5MB. Max. memory is 16.1GB. * Witness Printer took 3.49ms. Allocated memory is still 402.7MB. Free memory was 169.9MB in the beginning and 169.8MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 128, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 126, overapproximation of someBinaryFLOATComparisonOperation at line 132, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryFLOAToperation at line 96, overapproximation of someBinaryArithmeticFLOAToperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed long int var_1_29 = -128; [L47] signed char var_1_30 = -25; [L48] unsigned char var_1_31 = 0; [L49] unsigned char var_1_32 = 1; [L50] unsigned char var_1_33 = 1; [L51] signed short int var_1_34 = 0; [L52] signed short int last_1_var_1_12 = 2; [L53] signed long int last_1_var_1_13 = -256; [L54] double last_1_var_1_14 = 127.75; [L55] unsigned char last_1_var_1_21 = 0; VAL [isInitial=0, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L152] last_1_var_1_12 = var_1_12 [L153] last_1_var_1_13 = var_1_13 [L154] last_1_var_1_14 = var_1_14 [L155] last_1_var_1_21 = var_1_21 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L109] var_1_3 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L110] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L111] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L111] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L112] var_1_4 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L113] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L114] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L114] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L115] var_1_5 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L116] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L117] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L117] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L118] var_1_9 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L119] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L120] var_1_11 = __VERIFIER_nondet_ushort() [L121] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L121] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L122] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L122] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L123] var_1_15 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L124] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L125] var_1_17 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L126] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L127] var_1_18 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L128] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L129] var_1_19 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L130] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L131] var_1_20 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L132] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L133] var_1_22 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L134] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L136] var_1_24 = __VERIFIER_nondet_short() [L137] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L137] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L139] var_1_25 = __VERIFIER_nondet_short() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L142] var_1_27 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L143] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L144] var_1_29 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L145] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] CALL assume_abort_if_not(var_1_29 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] RET assume_abort_if_not(var_1_29 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L147] var_1_32 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET updateVariables() [L167] CALL step() [L59] var_1_26 = var_1_27 [L60] var_1_28 = var_1_29 [L61] var_1_30 = 0 [L62] var_1_31 = var_1_32 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L63] EXPR var_1_29 | ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L63] COND TRUE (var_1_29 | ((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30)))) >= var_1_28 [L64] var_1_33 = var_1_32 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L66] var_1_34 = var_1_30 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L67] COND FALSE !(\read(last_1_var_1_21)) [L70] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L72] COND TRUE var_1_18 > var_1_9 [L73] var_1_23 = (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L77] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L78] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L79] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L80] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L87] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L88] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L91] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L91] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L92] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L96] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L97] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L98] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L101] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L102] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L158-L159] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=3, var_1_15=3, var_1_16=4, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-256, var_1_24=-1, var_1_25=255, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 486 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 1714 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 981 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 733 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=487occurred in iteration=4, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 492 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1341 NumberOfCodeBlocks, 1341 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 999 ConstructedInterpolants, 0 QuantifiedInterpolants, 1337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 7152/7200 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-03 19:35:20,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_fillercode_fillercodesize_ps-cn-10_file-35.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 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 19:35:22,627 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 19:35:22,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 19:35:22,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 19:35:22,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 19:35:22,724 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 19:35:22,724 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 19:35:22,724 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 19:35:22,725 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 19:35:22,725 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 19:35:22,725 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 19:35:22,725 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 19:35:22,725 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 19:35:22,725 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 19:35:22,725 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 19:35:22,725 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 19:35:22,725 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 19:35:22,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 19:35:22,727 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:22,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 19:35:22,727 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 19:35:22,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 19:35:22,728 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 -> 565e0ccfcebbf397c474042ed1597507c39f364276a75ae06d7409adc8053426 [2025-03-03 19:35:22,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 19:35:22,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 19:35:22,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 19:35:22,936 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 19:35:22,936 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 19:35:22,937 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:24,138 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beafb5947/ee926c5785224c52af11556d88b99594/FLAGe377c47e3 [2025-03-03 19:35:24,337 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 19:35:24,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:24,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beafb5947/ee926c5785224c52af11556d88b99594/FLAGe377c47e3 [2025-03-03 19:35:24,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beafb5947/ee926c5785224c52af11556d88b99594 [2025-03-03 19:35:24,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 19:35:24,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 19:35:24,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:24,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 19:35:24,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 19:35:24,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52cdbfba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24, skipping insertion in model container [2025-03-03 19:35:24,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 19:35:24,485 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_fillercode_fillercodesize_ps-cn-10_file-35.i[915,928] [2025-03-03 19:35:24,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:24,534 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 19:35:24,541 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_fillercode_fillercodesize_ps-cn-10_file-35.i[915,928] [2025-03-03 19:35:24,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 19:35:24,574 INFO L204 MainTranslator]: Completed translation [2025-03-03 19:35:24,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24 WrapperNode [2025-03-03 19:35:24,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 19:35:24,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:24,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 19:35:24,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 19:35:24,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,590 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,612 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2025-03-03 19:35:24,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 19:35:24,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 19:35:24,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 19:35:24,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 19:35:24,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,623 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,631 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-03 19:35:24,631 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,638 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 19:35:24,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 19:35:24,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 19:35:24,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 19:35:24,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (1/1) ... [2025-03-03 19:35:24,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 19:35:24,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 19:35:24,675 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-03 19:35:24,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-03 19:35:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 19:35:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 19:35:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 19:35:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 19:35:24,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 19:35:24,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 19:35:24,772 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 19:35:24,773 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 19:35:26,192 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 19:35:26,192 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 19:35:26,200 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 19:35:26,200 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 19:35:26,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:26 BoogieIcfgContainer [2025-03-03 19:35:26,200 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 19:35:26,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 19:35:26,202 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 19:35:26,205 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 19:35:26,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 07:35:24" (1/3) ... [2025-03-03 19:35:26,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58398b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:26, skipping insertion in model container [2025-03-03 19:35:26,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 07:35:24" (2/3) ... [2025-03-03 19:35:26,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58398b5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 07:35:26, skipping insertion in model container [2025-03-03 19:35:26,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 07:35:26" (3/3) ... [2025-03-03 19:35:26,207 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i [2025-03-03 19:35:26,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 19:35:26,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-35.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 19:35:26,252 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 19:35:26,260 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;@59d19f4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 19:35:26,260 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 19:35:26,262 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:35:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:35:26,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:26,272 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:26,272 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:26,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:26,276 INFO L85 PathProgramCache]: Analyzing trace with hash 927220811, now seen corresponding path program 1 times [2025-03-03 19:35:26,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:26,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741811931] [2025-03-03 19:35:26,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:26,284 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-03 19:35:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:26,286 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-03 19:35:26,288 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-03 19:35:26,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:35:26,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:35:26,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:26,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:26,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 19:35:26,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:26,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 720 trivial. 0 not checked. [2025-03-03 19:35:26,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:26,658 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:35:26,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741811931] [2025-03-03 19:35:26,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741811931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:26,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:26,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 19:35:26,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948991047] [2025-03-03 19:35:26,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:26,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 19:35:26,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:35:26,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 19:35:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 19:35:26,675 INFO L87 Difference]: Start difference. First operand has 74 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:35:26,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:26,697 INFO L93 Difference]: Finished difference Result 142 states and 240 transitions. [2025-03-03 19:35:26,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 19:35:26,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2025-03-03 19:35:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:26,704 INFO L225 Difference]: With dead ends: 142 [2025-03-03 19:35:26,705 INFO L226 Difference]: Without dead ends: 71 [2025-03-03 19:35:26,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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-03 19:35:26,709 INFO L435 NwaCegarLoop]: 105 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, 105 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-03 19:35:26,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 19:35:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-03 19:35:26,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2025-03-03 19:35:26,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-03 19:35:26,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2025-03-03 19:35:26,743 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 163 [2025-03-03 19:35:26,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:26,743 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2025-03-03 19:35:26,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 19:35:26,744 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2025-03-03 19:35:26,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:35:26,746 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:26,746 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:26,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-03-03 19:35:26,947 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-03 19:35:26,947 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:26,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash 357831304, now seen corresponding path program 1 times [2025-03-03 19:35:26,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:26,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997454169] [2025-03-03 19:35:26,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:26,949 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-03 19:35:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:26,951 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-03 19:35:26,952 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-03 19:35:27,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:35:27,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:35:27,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:27,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:27,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 19:35:27,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:27,633 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:27,634 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:35:27,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997454169] [2025-03-03 19:35:27,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997454169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:27,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:27,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 19:35:27,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027637071] [2025-03-03 19:35:27,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:27,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 19:35:27,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:35:27,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 19:35:27,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 19:35:27,637 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:29,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:29,104 INFO L93 Difference]: Finished difference Result 226 states and 336 transitions. [2025-03-03 19:35:29,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 19:35:29,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2025-03-03 19:35:29,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:29,119 INFO L225 Difference]: With dead ends: 226 [2025-03-03 19:35:29,119 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 19:35:29,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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-03 19:35:29,120 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 95 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:29,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 323 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 19:35:29,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 19:35:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2025-03-03 19:35:29,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 50 states have call successors, (50), 2 states have call predecessors, (50), 2 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 19:35:29,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2025-03-03 19:35:29,143 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 163 [2025-03-03 19:35:29,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:29,146 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2025-03-03 19:35:29,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:29,146 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2025-03-03 19:35:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 19:35:29,149 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:29,149 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:29,158 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-03 19:35:29,349 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-03 19:35:29,349 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:29,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:29,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1865383113, now seen corresponding path program 1 times [2025-03-03 19:35:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:29,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987096109] [2025-03-03 19:35:29,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:29,351 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-03 19:35:29,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:29,354 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-03 19:35:29,355 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-03 19:35:29,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 19:35:29,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 19:35:29,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:29,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:29,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 19:35:29,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:29,933 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:29,933 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:35:29,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987096109] [2025-03-03 19:35:29,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987096109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:29,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:29,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 19:35:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043556647] [2025-03-03 19:35:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:29,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 19:35:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:35:29,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 19:35:29,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 19:35:29,934 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:32,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:32,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:32,507 INFO L93 Difference]: Finished difference Result 429 states and 642 transitions. [2025-03-03 19:35:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 19:35:32,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 163 [2025-03-03 19:35:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:32,524 INFO L225 Difference]: With dead ends: 429 [2025-03-03 19:35:32,524 INFO L226 Difference]: Without dead ends: 295 [2025-03-03 19:35:32,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:35:32,527 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 77 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:32,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 364 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 19:35:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-03 19:35:32,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 269. [2025-03-03 19:35:32,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 164 states have (on average 1.2439024390243902) internal successors, (204), 164 states have internal predecessors, (204), 100 states have call successors, (100), 4 states have call predecessors, (100), 4 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2025-03-03 19:35:32,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 404 transitions. [2025-03-03 19:35:32,575 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 404 transitions. Word has length 163 [2025-03-03 19:35:32,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:32,576 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 404 transitions. [2025-03-03 19:35:32,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:32,577 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 404 transitions. [2025-03-03 19:35:32,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:35:32,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:32,580 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:32,591 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-03 19:35:32,780 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-03 19:35:32,781 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:32,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:32,781 INFO L85 PathProgramCache]: Analyzing trace with hash 439106303, now seen corresponding path program 1 times [2025-03-03 19:35:32,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:32,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479596422] [2025-03-03 19:35:32,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:32,782 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-03 19:35:32,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:32,784 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-03 19:35:32,784 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-03 19:35:32,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:35:33,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:35:33,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:33,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:33,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 19:35:33,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:35:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2025-03-03 19:35:33,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 19:35:33,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 19:35:33,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479596422] [2025-03-03 19:35:33,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479596422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 19:35:33,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 19:35:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 19:35:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616051028] [2025-03-03 19:35:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 19:35:33,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 19:35:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 19:35:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 19:35:33,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 19:35:33,151 INFO L87 Difference]: Start difference. First operand 269 states and 404 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:36,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 19:35:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 19:35:37,443 INFO L93 Difference]: Finished difference Result 659 states and 984 transitions. [2025-03-03 19:35:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 19:35:37,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 164 [2025-03-03 19:35:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 19:35:37,456 INFO L225 Difference]: With dead ends: 659 [2025-03-03 19:35:37,456 INFO L226 Difference]: Without dead ends: 591 [2025-03-03 19:35:37,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 19:35:37,457 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 155 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-03-03 19:35:37,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 459 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-03-03 19:35:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2025-03-03 19:35:37,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 329. [2025-03-03 19:35:37,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 208 states have (on average 1.25) internal successors, (260), 210 states have internal predecessors, (260), 114 states have call successors, (114), 6 states have call predecessors, (114), 6 states have return successors, (114), 112 states have call predecessors, (114), 114 states have call successors, (114) [2025-03-03 19:35:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 488 transitions. [2025-03-03 19:35:37,516 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 488 transitions. Word has length 164 [2025-03-03 19:35:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 19:35:37,517 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 488 transitions. [2025-03-03 19:35:37,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2025-03-03 19:35:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 488 transitions. [2025-03-03 19:35:37,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-03-03 19:35:37,518 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 19:35:37,518 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 19:35:37,528 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 (5)] Ended with exit code 0 [2025-03-03 19:35:37,719 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-03 19:35:37,719 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 19:35:37,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 19:35:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1326609984, now seen corresponding path program 1 times [2025-03-03 19:35:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 19:35:37,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697609993] [2025-03-03 19:35:37,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 19:35:37,720 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-03 19:35:37,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 19:35:37,722 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-03 19:35:37,724 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-03 19:35:37,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-03-03 19:35:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-03-03 19:35:38,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 19:35:38,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 19:35:38,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 19:35:38,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 19:36:36,847 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)