./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-79.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 c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:58:58,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:58:58,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 23:58:58,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:58:58,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:58:58,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:58:58,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:58:58,516 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:58:58,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:58:58,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:58:58,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:58:58,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:58:58,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:58:58,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:58:58,517 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:58:58,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:58:58,518 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:58:58,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:58:58,519 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:58:58,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:58:58,519 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 -> c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 [2025-03-16 23:58:58,750 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:58:58,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:58:58,759 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:58:58,759 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:58:58,760 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:58:58,760 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-79.i [2025-03-16 23:58:59,895 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c33431e/8528bbaa26124848aac57641adb5e657/FLAG0cb52eb0e [2025-03-16 23:59:00,143 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:59:00,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-16 23:59:00,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c33431e/8528bbaa26124848aac57641adb5e657/FLAG0cb52eb0e [2025-03-16 23:59:00,162 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95c33431e/8528bbaa26124848aac57641adb5e657 [2025-03-16 23:59:00,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:59:00,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:59:00,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:00,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:59:00,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:59:00,172 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,173 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35249644 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00, skipping insertion in model container [2025-03-16 23:59:00,173 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:59:00,287 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-79.i[915,928] [2025-03-16 23:59:00,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:00,368 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:59:00,377 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-79.i[915,928] [2025-03-16 23:59:00,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:00,433 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:59:00,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00 WrapperNode [2025-03-16 23:59:00,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:00,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:00,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:59:00,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:59:00,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,450 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,483 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-03-16 23:59:00,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:00,485 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:59:00,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:59:00,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:59:00,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,506 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-16 23:59:00,506 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,506 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,512 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:59:00,525 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:59:00,525 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:59:00,525 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:59:00,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (1/1) ... [2025-03-16 23:59:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:00,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:00,554 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-16 23:59:00,560 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-16 23:59:00,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:59:00,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:59:00,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:59:00,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 23:59:00,576 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:59:00,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:59:00,646 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:59:00,647 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:59:00,930 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:59:00,931 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:59:00,941 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:59:00,942 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:59:00,942 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:00 BoogieIcfgContainer [2025-03-16 23:59:00,942 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:59:00,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:59:00,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:59:00,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:59:00,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:59:00" (1/3) ... [2025-03-16 23:59:00,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42435781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:00, skipping insertion in model container [2025-03-16 23:59:00,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:00" (2/3) ... [2025-03-16 23:59:00,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42435781 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:00, skipping insertion in model container [2025-03-16 23:59:00,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:00" (3/3) ... [2025-03-16 23:59:00,952 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-16 23:59:00,962 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:59:00,966 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:59:01,012 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:59:01,019 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;@506d6c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:59:01,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:59:01,023 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 23:59:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 23:59:01,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:01,034 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:01,034 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:01,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -345406958, now seen corresponding path program 1 times [2025-03-16 23:59:01,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67434570] [2025-03-16 23:59:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:01,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 23:59:01,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 23:59:01,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:01,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:01,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-16 23:59:01,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:01,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67434570] [2025-03-16 23:59:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67434570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:59:01,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261221207] [2025-03-16 23:59:01,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:01,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:01,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:01,319 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-16 23:59:01,320 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-16 23:59:01,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 23:59:01,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 23:59:01,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:01,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:01,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:59:01,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 2178 trivial. 0 not checked. [2025-03-16 23:59:01,536 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:01,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261221207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:01,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 23:59:01,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-16 23:59:01,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268756774] [2025-03-16 23:59:01,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:59:01,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:01,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:59:01,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:59:01,560 INFO L87 Difference]: Start difference. First operand has 81 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-16 23:59:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:01,577 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2025-03-16 23:59:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:59:01,579 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 205 [2025-03-16 23:59:01,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:01,583 INFO L225 Difference]: With dead ends: 159 [2025-03-16 23:59:01,583 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 23:59:01,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 206 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-16 23:59:01,587 INFO L435 NwaCegarLoop]: 123 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, 123 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-16 23:59:01,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 23:59:01,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 23:59:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 23:59:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-16 23:59:01,618 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 205 [2025-03-16 23:59:01,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:01,619 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-16 23:59:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-16 23:59:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-16 23:59:01,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 23:59:01,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:01,621 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:01,628 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-16 23:59:01,826 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-16 23:59:01,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:01,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:01,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2009005940, now seen corresponding path program 1 times [2025-03-16 23:59:01,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:01,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652911044] [2025-03-16 23:59:01,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:01,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 23:59:01,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 23:59:01,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:01,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:02,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:02,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:02,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652911044] [2025-03-16 23:59:02,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652911044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:02,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:02,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:02,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275014204] [2025-03-16 23:59:02,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:02,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:02,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:02,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:02,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:02,204 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:02,253 INFO L93 Difference]: Finished difference Result 235 states and 367 transitions. [2025-03-16 23:59:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:02,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 205 [2025-03-16 23:59:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:02,256 INFO L225 Difference]: With dead ends: 235 [2025-03-16 23:59:02,256 INFO L226 Difference]: Without dead ends: 157 [2025-03-16 23:59:02,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:02,257 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:02,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 241 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:02,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-16 23:59:02,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2025-03-16 23:59:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.2619047619047619) internal successors, (106), 84 states have internal predecessors, (106), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:59:02,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 242 transitions. [2025-03-16 23:59:02,290 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 242 transitions. Word has length 205 [2025-03-16 23:59:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:02,291 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 242 transitions. [2025-03-16 23:59:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 242 transitions. [2025-03-16 23:59:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-16 23:59:02,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:02,295 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:02,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 23:59:02,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:02,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1618287513, now seen corresponding path program 1 times [2025-03-16 23:59:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:02,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093034362] [2025-03-16 23:59:02,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:02,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:02,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-16 23:59:02,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-16 23:59:02,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:02,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093034362] [2025-03-16 23:59:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093034362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 23:59:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422160364] [2025-03-16 23:59:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:02,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:59:02,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:02,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:59:02,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:59:02,666 INFO L87 Difference]: Start difference. First operand 155 states and 242 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:02,867 INFO L93 Difference]: Finished difference Result 324 states and 503 transitions. [2025-03-16 23:59:02,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:59:02,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 206 [2025-03-16 23:59:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:02,872 INFO L225 Difference]: With dead ends: 324 [2025-03-16 23:59:02,872 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 23:59:02,873 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-16 23:59:02,876 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 88 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:02,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 409 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:59:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 23:59:02,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2025-03-16 23:59:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:59:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-03-16 23:59:02,906 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 206 [2025-03-16 23:59:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-03-16 23:59:02,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-03-16 23:59:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 23:59:02,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:02,913 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:02,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 23:59:02,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:02,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:02,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1659125654, now seen corresponding path program 1 times [2025-03-16 23:59:02,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:02,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099227616] [2025-03-16 23:59:02,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:02,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:02,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 23:59:02,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 23:59:02,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:02,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:03,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:03,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:03,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099227616] [2025-03-16 23:59:03,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099227616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:03,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:03,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:03,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936733581] [2025-03-16 23:59:03,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:03,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:03,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:03,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:03,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:03,085 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:03,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:03,115 INFO L93 Difference]: Finished difference Result 319 states and 499 transitions. [2025-03-16 23:59:03,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:03,115 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 207 [2025-03-16 23:59:03,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:03,117 INFO L225 Difference]: With dead ends: 319 [2025-03-16 23:59:03,117 INFO L226 Difference]: Without dead ends: 165 [2025-03-16 23:59:03,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:03,118 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 18 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:03,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 253 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-16 23:59:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 155. [2025-03-16 23:59:03,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.2261904761904763) internal successors, (103), 84 states have internal predecessors, (103), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:59:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 239 transitions. [2025-03-16 23:59:03,148 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 239 transitions. Word has length 207 [2025-03-16 23:59:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:03,149 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 239 transitions. [2025-03-16 23:59:03,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 239 transitions. [2025-03-16 23:59:03,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 23:59:03,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:03,153 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:03,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 23:59:03,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash 838890283, now seen corresponding path program 1 times [2025-03-16 23:59:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226109162] [2025-03-16 23:59:03,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:03,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 23:59:03,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 23:59:03,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:03,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:03,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:03,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226109162] [2025-03-16 23:59:03,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226109162] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:03,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:03,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235184297] [2025-03-16 23:59:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:03,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:03,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:03,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:03,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:03,388 INFO L87 Difference]: Start difference. First operand 155 states and 239 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:03,426 INFO L93 Difference]: Finished difference Result 324 states and 494 transitions. [2025-03-16 23:59:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:03,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 207 [2025-03-16 23:59:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:03,428 INFO L225 Difference]: With dead ends: 324 [2025-03-16 23:59:03,428 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 23:59:03,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:03,429 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 30 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:03,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 225 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:03,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 23:59:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2025-03-16 23:59:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 92 states have (on average 1.184782608695652) internal successors, (109), 93 states have internal predecessors, (109), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-16 23:59:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 253 transitions. [2025-03-16 23:59:03,460 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 253 transitions. Word has length 207 [2025-03-16 23:59:03,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 253 transitions. [2025-03-16 23:59:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 253 transitions. [2025-03-16 23:59:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 23:59:03,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:03,466 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:03,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 23:59:03,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:03,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:03,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1184282811, now seen corresponding path program 1 times [2025-03-16 23:59:03,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:03,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058695935] [2025-03-16 23:59:03,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:03,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:03,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:03,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:03,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:03,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-16 23:59:03,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 23:59:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058695935] [2025-03-16 23:59:03,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058695935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 23:59:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326447829] [2025-03-16 23:59:03,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:03,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:03,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:03,837 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-16 23:59:03,839 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-16 23:59:03,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:03,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:03,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:03,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:03,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 23:59:03,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:04,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1125 proven. 57 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-16 23:59:04,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:59:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-16 23:59:04,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326447829] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:59:04,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 23:59:04,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2025-03-16 23:59:04,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929268306] [2025-03-16 23:59:04,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 23:59:04,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 23:59:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 23:59:04,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 23:59:04,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-16 23:59:04,947 INFO L87 Difference]: Start difference. First operand 169 states and 253 transitions. Second operand has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) [2025-03-16 23:59:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:05,282 INFO L93 Difference]: Finished difference Result 271 states and 394 transitions. [2025-03-16 23:59:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 23:59:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) Word has length 208 [2025-03-16 23:59:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:05,285 INFO L225 Difference]: With dead ends: 271 [2025-03-16 23:59:05,285 INFO L226 Difference]: Without dead ends: 189 [2025-03-16 23:59:05,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 406 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2025-03-16 23:59:05,287 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 156 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:05,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 197 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 23:59:05,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-16 23:59:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 177. [2025-03-16 23:59:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 99 states have internal predecessors, (112), 72 states have call successors, (72), 6 states have call predecessors, (72), 6 states have return successors, (72), 71 states have call predecessors, (72), 72 states have call successors, (72) [2025-03-16 23:59:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 256 transitions. [2025-03-16 23:59:05,314 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 256 transitions. Word has length 208 [2025-03-16 23:59:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:05,315 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 256 transitions. [2025-03-16 23:59:05,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.352941176470588) internal successors, (108), 17 states have internal predecessors, (108), 5 states have call successors, (87), 3 states have call predecessors, (87), 6 states have return successors, (88), 5 states have call predecessors, (88), 5 states have call successors, (88) [2025-03-16 23:59:05,317 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 256 transitions. [2025-03-16 23:59:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 23:59:05,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:05,318 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:05,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 23:59:05,519 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-16 23:59:05,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:05,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1236120167, now seen corresponding path program 1 times [2025-03-16 23:59:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 23:59:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532533799] [2025-03-16 23:59:05,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:05,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 23:59:05,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:05,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:05,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:05,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 23:59:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1940899345] [2025-03-16 23:59:05,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:05,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:05,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:05,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 23:59:05,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 23:59:05,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:05,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:05,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:05,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:59:05,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-16 23:59:05,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:05,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:05,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:05,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-16 23:59:05,906 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-16 23:59:05,906 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-16 23:59:05,907 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 23:59:05,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 23:59:06,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 23:59:06,111 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-16 23:59:06,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 23:59:06,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 11:59:06 BoogieIcfgContainer [2025-03-16 23:59:06,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 23:59:06,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 23:59:06,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 23:59:06,223 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 23:59:06,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:00" (3/4) ... [2025-03-16 23:59:06,225 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-16 23:59:06,226 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 23:59:06,226 INFO L158 Benchmark]: Toolchain (without parser) took 6059.83ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 109.6MB in the beginning and 173.9MB in the end (delta: -64.3MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2025-03-16 23:59:06,227 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory was 127.1MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:06,227 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 93.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 23:59:06,227 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.65ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:06,228 INFO L158 Benchmark]: Boogie Preprocessor took 38.62ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 82.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 23:59:06,228 INFO L158 Benchmark]: IcfgBuilder took 417.44ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 57.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 23:59:06,228 INFO L158 Benchmark]: TraceAbstraction took 5275.02ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.2MB in the beginning and 173.9MB in the end (delta: -117.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2025-03-16 23:59:06,228 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 285.2MB. Free memory was 173.9MB in the beginning and 173.9MB in the end (delta: 87.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 23:59:06,229 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 was 127.1MB in the beginning and 126.7MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.61ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 93.2MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.65ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 89.9MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.62ms. Allocated memory is still 142.6MB. Free memory was 89.9MB in the beginning and 82.4MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 417.44ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 57.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5275.02ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 56.2MB in the beginning and 173.9MB in the end (delta: -117.8MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 285.2MB. Free memory was 173.9MB in the beginning and 173.9MB in the end (delta: 87.7kB). 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 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 137, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 129, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] signed short int var_1_29 = 16; [L48] signed short int var_1_30 = 64; [L49] signed long int var_1_31 = -64; [L50] double var_1_32 = 255.5; [L51] double var_1_33 = 100.3; [L52] signed short int var_1_34 = 100; [L53] float var_1_35 = 4.6; [L54] signed char var_1_36 = 4; [L55] signed char var_1_37 = 1; [L56] signed short int var_1_38 = 64; [L57] signed char var_1_39 = -64; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L176] last_1_var_1_18 = var_1_18 [L177] last_1_var_1_20 = var_1_20 [L187] RET updateLastVariables() [L188] CALL updateVariables() [L119] var_1_2 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L120] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L121] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L122] var_1_3 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L123] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L124] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L125] var_1_8 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L126] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_9=1021/8] [L127] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L127] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L128] var_1_10 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L129] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L130] var_1_11 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L131] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L132] var_1_13 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L133] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L134] var_1_14 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L135] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L136] var_1_15 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L137] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L138] var_1_16 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L139] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L140] var_1_17 = __VERIFIER_nondet_double() [L141] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] var_1_19 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] var_1_21 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L147] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L150] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L150] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L153] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L154] var_1_24 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L155] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L156] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L156] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L159] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L159] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=16, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L160] var_1_29 = __VERIFIER_nondet_short() [L161] CALL assume_abort_if_not(var_1_29 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L161] RET assume_abort_if_not(var_1_29 >= -1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L162] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L162] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=64, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L163] var_1_30 = __VERIFIER_nondet_short() [L164] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-64, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L166] var_1_31 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_31 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_31 >= -2147483648) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_31 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_31 <= 2147483647) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_33=1003/10, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L169] var_1_33 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L170] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=1, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L171] var_1_37 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L172] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L173] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L188] RET updateVariables() [L189] CALL step() [L63] COND TRUE (var_1_29 - var_1_30) <= var_1_31 [L64] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=511/2, var_1_34=100, var_1_35=23/5, var_1_36=4, var_1_37=-127, var_1_38=64, var_1_39=-64, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L66] var_1_32 = var_1_33 [L67] var_1_34 = 10 [L68] var_1_35 = var_1_33 [L69] var_1_36 = var_1_37 [L70] var_1_38 = var_1_37 [L71] var_1_39 = 8 [L72] signed long int stepLocal_1 = last_1_var_1_20; [L73] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L74] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L75] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L78] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L83] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=84/5, var_1_27=64, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L88] var_1_26 = var_1_16 [L89] var_1_27 = 10u [L90] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=1021/8] [L91] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L92] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L96] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L97] COND TRUE var_1_15 >= var_1_26 [L98] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L105] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L106] COND FALSE !(! var_1_18) [L109] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L114] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L115] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L189] RET step() [L190] CALL, EXPR property() [L180-L181] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=4, var_1_11=0, var_1_12=252, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=126, var_1_21=127, var_1_22=0, var_1_23=0, var_1_24=-255, var_1_25=1, var_1_26=3, var_1_27=10, var_1_28=32767, var_1_29=-1, var_1_2=1, var_1_30=32767, var_1_31=-32768, var_1_32=2, var_1_33=2, var_1_34=10, var_1_35=2, var_1_36=-127, var_1_37=-127, var_1_38=-127, var_1_39=8, var_1_3=0, var_1_7=0, var_1_8=0, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 161 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 7, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 348 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 348 mSDsluCounter, 1448 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 731 mSDsCounter, 274 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 274 mSolverCounterUnsat, 717 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 625 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=6, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 40 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2067 NumberOfCodeBlocks, 2067 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1850 ConstructedInterpolants, 0 QuantifiedInterpolants, 3837 SizeOfPredicates, 4 NumberOfNonLiveVariables, 985 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 19959/20196 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-16 23:59:06,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.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 c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 23:59:08,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 23:59:08,401 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-16 23:59:08,408 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 23:59:08,410 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 23:59:08,433 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 23:59:08,434 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 23:59:08,434 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 23:59:08,435 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 23:59:08,435 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 23:59:08,436 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 23:59:08,436 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 23:59:08,436 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 23:59:08,436 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 23:59:08,437 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 23:59:08,437 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 23:59:08,437 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 23:59:08,437 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 23:59:08,437 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 23:59:08,438 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 23:59:08,439 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 23:59:08,439 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 23:59:08,439 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 23:59:08,439 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 23:59:08,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:08,439 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 23:59:08,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 23:59:08,440 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 -> c13f5ed0009a51a528df2dab8d7969d0a833565e4fadaf9ebc068df7407508e3 [2025-03-16 23:59:08,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 23:59:08,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 23:59:08,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 23:59:08,715 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 23:59:08,716 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 23:59:08,718 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-79.i [2025-03-16 23:59:10,001 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b400a1016/eb0d697c3f2246e1bc335e3451c76262/FLAG2e0ac820a [2025-03-16 23:59:10,209 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 23:59:10,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-16 23:59:10,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b400a1016/eb0d697c3f2246e1bc335e3451c76262/FLAG2e0ac820a [2025-03-16 23:59:10,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b400a1016/eb0d697c3f2246e1bc335e3451c76262 [2025-03-16 23:59:10,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 23:59:10,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 23:59:10,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:10,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 23:59:10,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 23:59:10,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2979a4ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10, skipping insertion in model container [2025-03-16 23:59:10,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,261 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 23:59:10,367 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-79.i[915,928] [2025-03-16 23:59:10,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:10,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 23:59:10,458 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-79.i[915,928] [2025-03-16 23:59:10,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 23:59:10,521 INFO L204 MainTranslator]: Completed translation [2025-03-16 23:59:10,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10 WrapperNode [2025-03-16 23:59:10,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 23:59:10,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:10,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 23:59:10,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 23:59:10,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,542 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,570 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2025-03-16 23:59:10,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 23:59:10,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 23:59:10,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 23:59:10,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 23:59:10,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,592 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-16 23:59:10,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,593 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 23:59:10,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 23:59:10,614 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 23:59:10,614 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 23:59:10,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (1/1) ... [2025-03-16 23:59:10,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 23:59:10,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 23:59:10,638 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-16 23:59:10,643 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-16 23:59:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 23:59:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-16 23:59:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 23:59:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 23:59:10,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 23:59:10,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 23:59:10,721 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 23:59:10,723 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 23:59:19,129 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-16 23:59:19,129 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 23:59:19,137 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 23:59:19,137 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 23:59:19,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:19 BoogieIcfgContainer [2025-03-16 23:59:19,137 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 23:59:19,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 23:59:19,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 23:59:19,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 23:59:19,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 11:59:10" (1/3) ... [2025-03-16 23:59:19,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f644f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:19, skipping insertion in model container [2025-03-16 23:59:19,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 11:59:10" (2/3) ... [2025-03-16 23:59:19,143 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f644f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 11:59:19, skipping insertion in model container [2025-03-16 23:59:19,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 11:59:19" (3/3) ... [2025-03-16 23:59:19,144 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i [2025-03-16 23:59:19,154 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 23:59:19,155 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-79.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 23:59:19,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 23:59:19,193 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;@2c71ff6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 23:59:19,193 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 23:59:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 23:59:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 23:59:19,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:19,204 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:19,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:19,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:19,208 INFO L85 PathProgramCache]: Analyzing trace with hash -345406958, now seen corresponding path program 1 times [2025-03-16 23:59:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1568157812] [2025-03-16 23:59:19,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:19,215 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-16 23:59:19,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:19,217 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-16 23:59:19,218 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-16 23:59:19,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 23:59:19,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 23:59:19,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:19,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:19,666 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-16 23:59:19,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 930 proven. 0 refuted. 0 times theorem prover too weak. 1314 trivial. 0 not checked. [2025-03-16 23:59:19,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:19,720 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:19,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1568157812] [2025-03-16 23:59:19,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1568157812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:19,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 23:59:19,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400451751] [2025-03-16 23:59:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:19,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 23:59:19,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:19,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 23:59:19,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 23:59:19,745 INFO L87 Difference]: Start difference. First operand has 81 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 45 states have internal predecessors, (59), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-16 23:59:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:19,771 INFO L93 Difference]: Finished difference Result 159 states and 286 transitions. [2025-03-16 23:59:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 23:59:19,773 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 205 [2025-03-16 23:59:19,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:19,777 INFO L225 Difference]: With dead ends: 159 [2025-03-16 23:59:19,777 INFO L226 Difference]: Without dead ends: 79 [2025-03-16 23:59:19,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-16 23:59:19,781 INFO L435 NwaCegarLoop]: 123 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, 123 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-16 23:59:19,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 23:59:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-16 23:59:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-16 23:59:19,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-16 23:59:19,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 123 transitions. [2025-03-16 23:59:19,820 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 123 transitions. Word has length 205 [2025-03-16 23:59:19,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:19,820 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 123 transitions. [2025-03-16 23:59:19,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-03-16 23:59:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 123 transitions. [2025-03-16 23:59:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-16 23:59:19,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:19,826 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:19,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-16 23:59:20,027 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-16 23:59:20,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:20,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:20,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2009005940, now seen corresponding path program 1 times [2025-03-16 23:59:20,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:20,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045726579] [2025-03-16 23:59:20,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:20,029 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-16 23:59:20,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:20,031 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-16 23:59:20,032 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-16 23:59:20,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-16 23:59:20,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-16 23:59:20,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:20,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:20,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 23:59:20,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:21,512 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:21,512 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:21,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045726579] [2025-03-16 23:59:21,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045726579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:21,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:21,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:59:21,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747037709] [2025-03-16 23:59:21,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:21,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:59:21,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:21,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:59:21,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:59:21,514 INFO L87 Difference]: Start difference. First operand 79 states and 123 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:26,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:28,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:28,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:28,265 INFO L93 Difference]: Finished difference Result 248 states and 386 transitions. [2025-03-16 23:59:28,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:59:28,265 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 205 [2025-03-16 23:59:28,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:28,269 INFO L225 Difference]: With dead ends: 248 [2025-03-16 23:59:28,270 INFO L226 Difference]: Without dead ends: 170 [2025-03-16 23:59:28,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:59:28,277 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 85 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 71 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:28,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 409 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 92 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2025-03-16 23:59:28,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-16 23:59:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 155. [2025-03-16 23:59:28,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 84 states have (on average 1.25) internal successors, (105), 84 states have internal predecessors, (105), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-16 23:59:28,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 241 transitions. [2025-03-16 23:59:28,310 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 241 transitions. Word has length 205 [2025-03-16 23:59:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:28,312 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 241 transitions. [2025-03-16 23:59:28,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:28,312 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 241 transitions. [2025-03-16 23:59:28,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 23:59:28,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:28,316 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:28,333 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 (3)] Forceful destruction successful, exit code 0 [2025-03-16 23:59:28,516 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-16 23:59:28,517 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:28,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1659125654, now seen corresponding path program 1 times [2025-03-16 23:59:28,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:28,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221338753] [2025-03-16 23:59:28,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:28,518 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-16 23:59:28,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:28,520 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-16 23:59:28,521 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-16 23:59:28,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 23:59:28,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 23:59:28,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:28,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 23:59:28,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:29,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:29,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:29,982 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:29,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221338753] [2025-03-16 23:59:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221338753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:29,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:29,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 23:59:29,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975973046] [2025-03-16 23:59:29,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 23:59:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:29,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 23:59:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 23:59:29,984 INFO L87 Difference]: Start difference. First operand 155 states and 241 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:32,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:36,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:38,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:40,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:40,454 INFO L93 Difference]: Finished difference Result 399 states and 619 transitions. [2025-03-16 23:59:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 23:59:40,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 207 [2025-03-16 23:59:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:40,486 INFO L225 Difference]: With dead ends: 399 [2025-03-16 23:59:40,486 INFO L226 Difference]: Without dead ends: 245 [2025-03-16 23:59:40,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 23:59:40,487 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 69 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:40,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 398 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 88 Invalid, 1 Unknown, 0 Unchecked, 10.4s Time] [2025-03-16 23:59:40,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-16 23:59:40,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 219. [2025-03-16 23:59:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 113 states have internal predecessors, (135), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:59:40,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 339 transitions. [2025-03-16 23:59:40,522 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 339 transitions. Word has length 207 [2025-03-16 23:59:40,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:40,522 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 339 transitions. [2025-03-16 23:59:40,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:40,523 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 339 transitions. [2025-03-16 23:59:40,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 23:59:40,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:40,524 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:40,540 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-16 23:59:40,725 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-16 23:59:40,726 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:40,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:40,726 INFO L85 PathProgramCache]: Analyzing trace with hash 838890283, now seen corresponding path program 1 times [2025-03-16 23:59:40,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:40,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863295873] [2025-03-16 23:59:40,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-16 23:59:40,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:40,730 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-16 23:59:40,731 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-16 23:59:40,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 23:59:41,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 23:59:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:41,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 23:59:41,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2025-03-16 23:59:41,182 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 23:59:41,182 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:41,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863295873] [2025-03-16 23:59:41,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863295873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 23:59:41,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 23:59:41,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 23:59:41,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580893970] [2025-03-16 23:59:41,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 23:59:41,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 23:59:41,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:41,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 23:59:41,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:41,184 INFO L87 Difference]: Start difference. First operand 219 states and 339 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:44,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:44,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:44,112 INFO L93 Difference]: Finished difference Result 381 states and 585 transitions. [2025-03-16 23:59:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 23:59:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 207 [2025-03-16 23:59:44,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:44,115 INFO L225 Difference]: With dead ends: 381 [2025-03-16 23:59:44,115 INFO L226 Difference]: Without dead ends: 227 [2025-03-16 23:59:44,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 23:59:44,116 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 30 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:44,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-16 23:59:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-16 23:59:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-16 23:59:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 119 states have (on average 1.1680672268907564) internal successors, (139), 119 states have internal predecessors, (139), 102 states have call successors, (102), 5 states have call predecessors, (102), 5 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:59:44,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 343 transitions. [2025-03-16 23:59:44,145 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 343 transitions. Word has length 207 [2025-03-16 23:59:44,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:44,146 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 343 transitions. [2025-03-16 23:59:44,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2025-03-16 23:59:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 343 transitions. [2025-03-16 23:59:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 23:59:44,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:44,148 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:44,163 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-16 23:59:44,348 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-16 23:59:44,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:44,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:44,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1184282811, now seen corresponding path program 1 times [2025-03-16 23:59:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:44,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025418969] [2025-03-16 23:59:44,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:44,350 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-16 23:59:44,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:44,351 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-16 23:59:44,352 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-16 23:59:44,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:44,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:44,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:44,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:44,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 23:59:44,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 23:59:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1125 proven. 57 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-03-16 23:59:45,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 23:59:46,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 42 proven. 57 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2025-03-16 23:59:46,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-16 23:59:46,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025418969] [2025-03-16 23:59:46,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025418969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 23:59:46,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-16 23:59:46,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2025-03-16 23:59:46,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425199132] [2025-03-16 23:59:46,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-16 23:59:46,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 23:59:46,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-16 23:59:46,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 23:59:46,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 23:59:46,056 INFO L87 Difference]: Start difference. First operand 227 states and 343 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-16 23:59:51,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:53,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-16 23:59:53,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 23:59:53,783 INFO L93 Difference]: Finished difference Result 337 states and 492 transitions. [2025-03-16 23:59:53,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 23:59:53,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 208 [2025-03-16 23:59:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 23:59:53,818 INFO L225 Difference]: With dead ends: 337 [2025-03-16 23:59:53,818 INFO L226 Difference]: Without dead ends: 255 [2025-03-16 23:59:53,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 407 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2025-03-16 23:59:53,820 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 151 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 161 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-03-16 23:59:53,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 167 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 179 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2025-03-16 23:59:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-16 23:59:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 239. [2025-03-16 23:59:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 128 states have (on average 1.140625) internal successors, (146), 128 states have internal predecessors, (146), 102 states have call successors, (102), 8 states have call predecessors, (102), 8 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-16 23:59:53,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 350 transitions. [2025-03-16 23:59:53,843 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 350 transitions. Word has length 208 [2025-03-16 23:59:53,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 23:59:53,844 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 350 transitions. [2025-03-16 23:59:53,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (53), 2 states have call predecessors, (53), 4 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-03-16 23:59:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 350 transitions. [2025-03-16 23:59:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-16 23:59:53,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 23:59:53,846 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:59:53,862 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 (6)] Forceful destruction successful, exit code 0 [2025-03-16 23:59:54,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-16 23:59:54,047 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 23:59:54,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 23:59:54,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1236120167, now seen corresponding path program 1 times [2025-03-16 23:59:54,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-16 23:59:54,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881298892] [2025-03-16 23:59:54,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 23:59:54,048 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-16 23:59:54,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-16 23:59:54,050 INFO L229 MonitoredProcess]: Starting monitored process 7 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-16 23:59:54,051 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 (7)] Waiting until timeout for monitored process [2025-03-16 23:59:54,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-16 23:59:54,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-16 23:59:54,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 23:59:54,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 23:59:54,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-16 23:59:54,477 INFO L279 TraceCheckSpWp]: Computing forward predicates...