./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:51:26,434 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:51:26,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 10:51:26,495 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:51:26,495 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:51:26,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:51:26,516 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:51:26,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:51:26,517 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:51:26,517 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:51:26,517 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:51:26,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:51:26,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:51:26,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:51:26,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:51:26,518 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:51:26,519 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:51:26,519 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:26,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:51:26,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:51:26,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:51:26,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:51:26,521 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2025-03-08 10:51:26,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:51:26,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:51:26,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:51:26,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:51:26,754 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:51:26,755 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-72.i [2025-03-08 10:51:27,883 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b27ac47/2fa92b3818ce45efa5942be9cd2cfe33/FLAG2ff681aaa [2025-03-08 10:51:28,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:51:28,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2025-03-08 10:51:28,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b27ac47/2fa92b3818ce45efa5942be9cd2cfe33/FLAG2ff681aaa [2025-03-08 10:51:28,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45b27ac47/2fa92b3818ce45efa5942be9cd2cfe33 [2025-03-08 10:51:28,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:51:28,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:51:28,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:28,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:51:28,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:51:28,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f2962fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28, skipping insertion in model container [2025-03-08 10:51:28,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:51:28,298 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-72.i[915,928] [2025-03-08 10:51:28,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:28,365 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:51:28,374 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-72.i[915,928] [2025-03-08 10:51:28,408 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:28,426 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:51:28,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28 WrapperNode [2025-03-08 10:51:28,427 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:28,428 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:28,429 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:51:28,429 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:51:28,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,467 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2025-03-08 10:51:28,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:28,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:51:28,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:51:28,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:51:28,476 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,478 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,493 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:51:28,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,493 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,498 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:51:28,503 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:51:28,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:51:28,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:51:28,506 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (1/1) ... [2025-03-08 10:51:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:28,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:28,534 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:51:28,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:51:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:51:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:51:28,554 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:51:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 10:51:28,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:51:28,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:51:28,612 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:51:28,614 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:51:28,856 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 10:51:28,856 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:51:28,867 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:51:28,869 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:51:28,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:28 BoogieIcfgContainer [2025-03-08 10:51:28,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:51:28,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:51:28,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:51:28,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:51:28,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:28" (1/3) ... [2025-03-08 10:51:28,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298a3433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:28, skipping insertion in model container [2025-03-08 10:51:28,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:28" (2/3) ... [2025-03-08 10:51:28,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298a3433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:28, skipping insertion in model container [2025-03-08 10:51:28,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:28" (3/3) ... [2025-03-08 10:51:28,877 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2025-03-08 10:51:28,887 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:51:28,888 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:51:28,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:51:28,934 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;@3842d040, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:51:28,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:51:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:28,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 10:51:28,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:28,944 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:28,945 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:28,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:28,948 INFO L85 PathProgramCache]: Analyzing trace with hash -600922772, now seen corresponding path program 1 times [2025-03-08 10:51:28,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:28,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510575534] [2025-03-08 10:51:28,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:28,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:29,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:51:29,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:51:29,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:29,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:29,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 10:51:29,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:29,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510575534] [2025-03-08 10:51:29,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510575534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:51:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220223013] [2025-03-08 10:51:29,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:29,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:29,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:29,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:51:29,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 10:51:29,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:51:29,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:51:29,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:29,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:29,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:51:29,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:29,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-03-08 10:51:29,425 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220223013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 10:51:29,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 10:51:29,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918581034] [2025-03-08 10:51:29,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:29,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:51:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:29,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:51:29,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:29,452 INFO L87 Difference]: Start difference. First operand has 79 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:29,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:29,484 INFO L93 Difference]: Finished difference Result 152 states and 263 transitions. [2025-03-08 10:51:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:51:29,487 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 176 [2025-03-08 10:51:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:29,493 INFO L225 Difference]: With dead ends: 152 [2025-03-08 10:51:29,494 INFO L226 Difference]: Without dead ends: 76 [2025-03-08 10:51:29,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:29,500 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:29,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:51:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-08 10:51:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-08 10:51:29,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:29,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2025-03-08 10:51:29,547 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 176 [2025-03-08 10:51:29,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:29,547 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2025-03-08 10:51:29,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:29,548 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2025-03-08 10:51:29,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 10:51:29,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:29,552 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:29,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 10:51:29,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 10:51:29,753 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:29,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -11803506, now seen corresponding path program 1 times [2025-03-08 10:51:29,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:29,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773174358] [2025-03-08 10:51:29,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:29,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:29,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:51:29,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:51:29,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:29,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773174358] [2025-03-08 10:51:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773174358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:30,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:30,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:51:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111747583] [2025-03-08 10:51:30,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:30,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 10:51:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:30,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 10:51:30,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 10:51:30,131 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:30,189 INFO L93 Difference]: Finished difference Result 166 states and 250 transitions. [2025-03-08 10:51:30,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 10:51:30,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-08 10:51:30,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:30,193 INFO L225 Difference]: With dead ends: 166 [2025-03-08 10:51:30,193 INFO L226 Difference]: Without dead ends: 93 [2025-03-08 10:51:30,194 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-08 10:51:30,196 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:30,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 225 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:51:30,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-08 10:51:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 80. [2025-03-08 10:51:30,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 10:51:30,206 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 176 [2025-03-08 10:51:30,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:30,207 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 10:51:30,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:30,208 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 10:51:30,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 10:51:30,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:30,212 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:30,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 10:51:30,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:30,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash 97913461, now seen corresponding path program 1 times [2025-03-08 10:51:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334289481] [2025-03-08 10:51:30,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:30,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:30,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:30,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:30,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334289481] [2025-03-08 10:51:30,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334289481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:30,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:30,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:51:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110926405] [2025-03-08 10:51:30,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:30,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:30,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:30,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:30,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:30,390 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:30,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:30,562 INFO L93 Difference]: Finished difference Result 230 states and 351 transitions. [2025-03-08 10:51:30,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:51:30,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 177 [2025-03-08 10:51:30,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:30,566 INFO L225 Difference]: With dead ends: 230 [2025-03-08 10:51:30,567 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 10:51:30,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:51:30,569 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 156 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:30,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 204 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:51:30,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 10:51:30,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 80. [2025-03-08 10:51:30,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:30,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-03-08 10:51:30,584 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 177 [2025-03-08 10:51:30,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-03-08 10:51:30,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-03-08 10:51:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 10:51:30,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:30,588 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:30,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 10:51:30,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:30,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:30,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1431327063, now seen corresponding path program 1 times [2025-03-08 10:51:30,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:30,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051156474] [2025-03-08 10:51:30,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:30,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:30,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:30,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:30,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:30,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051156474] [2025-03-08 10:51:30,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051156474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:30,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:30,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:51:30,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669518592] [2025-03-08 10:51:30,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:30,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:30,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:30,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:30,967 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:31,148 INFO L93 Difference]: Finished difference Result 246 states and 371 transitions. [2025-03-08 10:51:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:51:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-03-08 10:51:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:31,151 INFO L225 Difference]: With dead ends: 246 [2025-03-08 10:51:31,152 INFO L226 Difference]: Without dead ends: 169 [2025-03-08 10:51:31,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:31,156 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 161 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:31,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 334 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:51:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-08 10:51:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 104. [2025-03-08 10:51:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2025-03-08 10:51:31,185 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 153 transitions. Word has length 177 [2025-03-08 10:51:31,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:31,186 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 153 transitions. [2025-03-08 10:51:31,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:31,186 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 153 transitions. [2025-03-08 10:51:31,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 10:51:31,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:31,187 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:31,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 10:51:31,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:31,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:31,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1120829898, now seen corresponding path program 1 times [2025-03-08 10:51:31,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:31,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998470637] [2025-03-08 10:51:31,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:31,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:31,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:31,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:31,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:31,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:31,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 10:51:31,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998470637] [2025-03-08 10:51:31,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998470637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 10:51:31,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792792763] [2025-03-08 10:51:31,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:31,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:31,430 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:51:31,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 10:51:31,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:31,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:31,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:31,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:31,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 10:51:31,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-08 10:51:31,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:51:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 10:51:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792792763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:51:32,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 10:51:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-08 10:51:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512483294] [2025-03-08 10:51:32,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 10:51:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:51:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:51:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:51:32,106 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 10:51:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:32,304 INFO L93 Difference]: Finished difference Result 197 states and 291 transitions. [2025-03-08 10:51:32,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:51:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 177 [2025-03-08 10:51:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:32,306 INFO L225 Difference]: With dead ends: 197 [2025-03-08 10:51:32,306 INFO L226 Difference]: Without dead ends: 96 [2025-03-08 10:51:32,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 351 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:51:32,310 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 70 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:32,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 197 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 10:51:32,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-08 10:51:32,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-03-08 10:51:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-08 10:51:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 136 transitions. [2025-03-08 10:51:32,334 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 136 transitions. Word has length 177 [2025-03-08 10:51:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:32,334 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 136 transitions. [2025-03-08 10:51:32,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 10:51:32,334 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 136 transitions. [2025-03-08 10:51:32,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 10:51:32,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:32,336 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:32,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 10:51:32,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:32,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:32,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:32,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1234813558, now seen corresponding path program 1 times [2025-03-08 10:51:32,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:32,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861095258] [2025-03-08 10:51:32,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:32,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:32,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:32,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:32,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:32,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:51:32,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2135099066] [2025-03-08 10:51:32,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:32,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:32,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:32,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:51:32,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 10:51:32,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:51:32,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:51:32,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:32,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:32,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 10:51:32,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:33,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:33,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861095258] [2025-03-08 10:51:33,239 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 10:51:33,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135099066] [2025-03-08 10:51:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135099066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:51:33,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001482133] [2025-03-08 10:51:33,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:33,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:33,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:33,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:33,242 INFO L87 Difference]: Start difference. First operand 93 states and 136 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:33,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:33,365 INFO L93 Difference]: Finished difference Result 258 states and 376 transitions. [2025-03-08 10:51:33,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:51:33,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-03-08 10:51:33,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:33,368 INFO L225 Difference]: With dead ends: 258 [2025-03-08 10:51:33,368 INFO L226 Difference]: Without dead ends: 177 [2025-03-08 10:51:33,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:51:33,369 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 78 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:33,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 326 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:51:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2025-03-08 10:51:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 144. [2025-03-08 10:51:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:51:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 211 transitions. [2025-03-08 10:51:33,395 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 211 transitions. Word has length 177 [2025-03-08 10:51:33,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:33,396 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 211 transitions. [2025-03-08 10:51:33,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 211 transitions. [2025-03-08 10:51:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 10:51:33,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:33,397 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:33,404 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-08 10:51:33,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:33,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:33,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:33,598 INFO L85 PathProgramCache]: Analyzing trace with hash 341072239, now seen corresponding path program 1 times [2025-03-08 10:51:33,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:33,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170141758] [2025-03-08 10:51:33,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:33,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:33,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 10:51:33,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 10:51:33,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:33,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170141758] [2025-03-08 10:51:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170141758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:51:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629304672] [2025-03-08 10:51:33,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:33,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:33,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:33,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:33,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:33,767 INFO L87 Difference]: Start difference. First operand 144 states and 211 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:33,882 INFO L93 Difference]: Finished difference Result 247 states and 360 transitions. [2025-03-08 10:51:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:51:33,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-08 10:51:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:33,884 INFO L225 Difference]: With dead ends: 247 [2025-03-08 10:51:33,886 INFO L226 Difference]: Without dead ends: 166 [2025-03-08 10:51:33,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:51:33,887 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 68 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:33,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 321 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:51:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-08 10:51:33,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2025-03-08 10:51:33,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 84 states have (on average 1.1904761904761905) internal successors, (100), 84 states have internal predecessors, (100), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:51:33,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2025-03-08 10:51:33,913 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 178 [2025-03-08 10:51:33,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2025-03-08 10:51:33,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2025-03-08 10:51:33,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 10:51:33,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:33,917 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:33,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 10:51:33,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:33,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:33,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1558753012, now seen corresponding path program 1 times [2025-03-08 10:51:33,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:33,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673831847] [2025-03-08 10:51:33,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:33,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:33,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 10:51:33,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 10:51:33,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:33,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:34,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:34,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 10:51:34,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673831847] [2025-03-08 10:51:34,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673831847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:34,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:34,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 10:51:34,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841913060] [2025-03-08 10:51:34,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:34,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:34,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 10:51:34,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:34,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:34,009 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:34,132 INFO L93 Difference]: Finished difference Result 303 states and 444 transitions. [2025-03-08 10:51:34,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:51:34,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-03-08 10:51:34,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:34,134 INFO L225 Difference]: With dead ends: 303 [2025-03-08 10:51:34,134 INFO L226 Difference]: Without dead ends: 222 [2025-03-08 10:51:34,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:51:34,134 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 143 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:34,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 200 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 10:51:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-08 10:51:34,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 141. [2025-03-08 10:51:34,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:51:34,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 206 transitions. [2025-03-08 10:51:34,153 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 206 transitions. Word has length 178 [2025-03-08 10:51:34,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:34,153 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 206 transitions. [2025-03-08 10:51:34,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:34,154 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 206 transitions. [2025-03-08 10:51:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-08 10:51:34,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:34,155 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:34,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 10:51:34,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:34,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:34,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1013935640, now seen corresponding path program 1 times [2025-03-08 10:51:34,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 10:51:34,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287854588] [2025-03-08 10:51:34,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:34,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 10:51:34,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 10:51:34,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 10:51:34,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:34,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 10:51:34,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1030207196] [2025-03-08 10:51:34,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:34,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:34,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:34,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 10:51:34,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 10:51:34,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 10:51:34,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 10:51:34,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:34,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:51:34,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 10:51:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 10:51:34,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 10:51:34,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:34,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 10:51:34,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 10:51:34,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 10:51:34,467 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 10:51:34,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 10:51:34,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 10:51:34,671 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:34,786 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 10:51:34,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:51:34 BoogieIcfgContainer [2025-03-08 10:51:34,790 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 10:51:34,791 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 10:51:34,791 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 10:51:34,791 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 10:51:34,791 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:28" (3/4) ... [2025-03-08 10:51:34,793 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-08 10:51:34,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 10:51:34,794 INFO L158 Benchmark]: Toolchain (without parser) took 6620.49ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 106.2MB in the beginning and 248.7MB in the end (delta: -142.5MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,795 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:51:34,795 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.16ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 91.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,795 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.50ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 10:51:34,795 INFO L158 Benchmark]: Boogie Preprocessor took 34.12ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,795 INFO L158 Benchmark]: IcfgBuilder took 366.52ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 63.2MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,796 INFO L158 Benchmark]: TraceAbstraction took 5918.34ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.2MB in the beginning and 248.8MB in the end (delta: -185.6MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,796 INFO L158 Benchmark]: Witness Printer took 2.89ms. Allocated memory is still 310.4MB. Free memory was 248.8MB in the beginning and 248.7MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 10:51:34,797 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.16ms. Allocated memory is still 142.6MB. Free memory was 106.2MB in the beginning and 91.7MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.50ms. Allocated memory is still 142.6MB. Free memory was 91.7MB in the beginning and 89.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.12ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 366.52ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 63.2MB in the end (delta: 22.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5918.34ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 63.2MB in the beginning and 248.8MB in the end (delta: -185.6MB). Peak memory consumption was 131.5MB. Max. memory is 16.1GB. * Witness Printer took 2.89ms. Allocated memory is still 310.4MB. Free memory was 248.8MB in the beginning and 248.7MB in the end (delta: 92.3kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 142, overapproximation of someBinaryDOUBLEComparisonOperation at line 164, overapproximation of someBinaryDOUBLEComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 72. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_10 = 2; [L24] signed char var_1_11 = 1; [L25] float var_1_14 = 64.3; [L26] signed char var_1_16 = 32; [L27] unsigned char var_1_17 = 1; [L28] unsigned char var_1_18 = 0; [L29] unsigned char var_1_19 = 0; [L30] double var_1_20 = 9.25; [L31] double var_1_21 = 255.05; [L32] double var_1_22 = 25.5; [L33] unsigned char var_1_23 = 2; [L34] unsigned char var_1_25 = 1; [L35] unsigned short int var_1_26 = 5; [L36] unsigned char var_1_27 = 128; [L37] unsigned char var_1_28 = 1; [L38] signed long int var_1_29 = 128; [L39] unsigned long int var_1_31 = 1; [L40] unsigned long int var_1_32 = 64; [L41] unsigned long int var_1_33 = 100; [L42] double var_1_34 = 63.5; [L43] double var_1_35 = 3.75; [L44] signed long int var_1_36 = -10; [L45] signed long int var_1_37 = 64; [L46] signed long int var_1_38 = 32; [L47] signed long int var_1_39 = -1000000; [L48] signed char var_1_40 = 8; [L49] signed char var_1_41 = -4; [L50] unsigned char var_1_42 = 25; [L51] unsigned char var_1_43 = 8; [L52] unsigned char last_1_var_1_17 = 1; [L53] double last_1_var_1_20 = 9.25; [L54] unsigned char last_1_var_1_23 = 2; [L55] unsigned short int last_1_var_1_26 = 5; [L56] signed long int last_1_var_1_29 = 128; VAL [isInitial=0, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L168] isInitial = 1 [L169] FCALL initially() [L170] COND TRUE 1 [L171] CALL updateLastVariables() [L157] last_1_var_1_17 = var_1_17 [L158] last_1_var_1_20 = var_1_20 [L159] last_1_var_1_23 = var_1_23 [L160] last_1_var_1_26 = var_1_26 [L161] last_1_var_1_29 = var_1_29 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=1, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L171] RET updateLastVariables() [L172] CALL updateVariables() [L111] var_1_11 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L112] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L113] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_14=643/10, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L114] var_1_14 = __VERIFIER_nondet_float() [L115] 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_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L115] 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_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=32, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L116] var_1_16 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_16 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L117] RET assume_abort_if_not(var_1_16 >= -63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L118] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L119] var_1_18 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L120] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L121] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L122] var_1_19 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_19 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L123] RET assume_abort_if_not(var_1_19 >= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L124] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_21=5101/20, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L125] var_1_21 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L126] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_22=51/2, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L127] var_1_22 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L128] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=1, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L129] var_1_25 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] CALL assume_abort_if_not(var_1_25 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L131] RET assume_abort_if_not(var_1_25 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=128, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L132] var_1_27 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L133] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] CALL assume_abort_if_not(var_1_27 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L134] RET assume_abort_if_not(var_1_27 <= 255) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=1, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L135] var_1_28 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L136] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L137] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=100, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L138] var_1_33 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L139] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L140] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_35=15/4, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L141] var_1_35 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L142] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=32, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L143] var_1_38 = __VERIFIER_nondet_long() [L144] CALL assume_abort_if_not(var_1_38 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L144] RET assume_abort_if_not(var_1_38 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] CALL assume_abort_if_not(var_1_38 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L145] RET assume_abort_if_not(var_1_38 <= 2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-1000000, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L146] var_1_39 = __VERIFIER_nondet_long() [L147] CALL assume_abort_if_not(var_1_39 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L147] RET assume_abort_if_not(var_1_39 >= -2147483647) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] CALL assume_abort_if_not(var_1_39 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L148] RET assume_abort_if_not(var_1_39 <= 2147483646) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-4, var_1_42=25, var_1_43=8] [L149] var_1_41 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L150] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L151] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=8] [L152] var_1_43 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L153] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25] [L154] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L154] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=64, var_1_33=1, var_1_34=127/2, var_1_36=-10, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L172] RET updateVariables() [L173] CALL step() [L60] var_1_32 = var_1_33 [L61] var_1_34 = var_1_35 [L62] var_1_36 = -256 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] EXPR ((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=64, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L63] COND TRUE var_1_36 >= (((((var_1_38) < 0 ) ? -(var_1_38) : (var_1_38))) | var_1_32) [L64] var_1_37 = var_1_39 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=8, var_1_41=-127, var_1_42=25, var_1_43=0] [L66] var_1_40 = var_1_41 [L67] var_1_42 = var_1_43 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L68] COND FALSE !((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L71] COND TRUE last_1_var_1_17 || last_1_var_1_17 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=2, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L72] COND TRUE (((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20) [L73] var_1_10 = (var_1_11 + var_1_16) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=2, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L81] COND TRUE (last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26 [L82] var_1_23 = var_1_25 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L84] var_1_17 = (var_1_18 && var_1_19) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L85] COND FALSE !(! var_1_18) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L88] COND TRUE 256 >= var_1_10 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=5, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L89] COND TRUE var_1_17 && (var_1_25 >= (var_1_27 - var_1_28)) [L90] var_1_26 = 16 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L97] signed long int stepLocal_0 = var_1_23 * var_1_26; VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=16, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L98] COND FALSE !(((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) [L105] var_1_1 = -50 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=128, var_1_31=1, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L107] var_1_31 = var_1_26 [L108] var_1_29 = var_1_1 VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, stepLocal_0=0, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L173] RET step() [L174] CALL, EXPR property() [L164-L165] return ((((((((((((var_1_20) < (63.5)) ? (var_1_20) : (63.5))) > (2.4 * var_1_20)) ? (((var_1_23 * var_1_26) <= (~ var_1_26)) ? (var_1_1 == ((signed short int) (((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) + var_1_23))) : (var_1_1 == ((signed short int) var_1_10))) : (var_1_1 == ((signed short int) -50))) && (((last_1_var_1_29 * last_1_var_1_23) <= last_1_var_1_29) ? (var_1_10 == ((signed char) (var_1_11 + 10))) : ((last_1_var_1_17 || last_1_var_1_17) ? (((((((last_1_var_1_20) < 0 ) ? -(last_1_var_1_20) : (last_1_var_1_20))) - var_1_14) == (last_1_var_1_20 + last_1_var_1_20)) ? (var_1_10 == ((signed char) (var_1_11 + var_1_16))) : (var_1_10 == ((signed char) var_1_11))) : (var_1_10 == ((signed char) var_1_16))))) && (var_1_17 == ((unsigned char) (var_1_18 && var_1_19)))) && ((! var_1_18) ? (var_1_20 == ((double) ((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22))))) : 1)) && (((last_1_var_1_29 + last_1_var_1_29) > last_1_var_1_26) ? (var_1_23 == ((unsigned char) var_1_25)) : 1)) && ((256 >= var_1_10) ? ((var_1_17 && (var_1_25 >= (var_1_27 - var_1_28))) ? (var_1_26 == ((unsigned short int) 16)) : (var_1_26 == ((unsigned short int) var_1_28))) : (var_1_26 == ((unsigned short int) var_1_25)))) && (var_1_29 == ((signed long int) var_1_1))) && (var_1_31 == ((unsigned long int) var_1_26)) ; VAL [\result=0, isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L174] RET, EXPR property() [L174] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=1, last_1_var_1_20=37/4, last_1_var_1_23=2, last_1_var_1_26=5, last_1_var_1_29=128, var_1_10=64, var_1_11=63, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=1, var_1_1=-50, var_1_20=37/4, var_1_23=0, var_1_25=0, var_1_26=16, var_1_27=127, var_1_28=127, var_1_29=-50, var_1_31=16, var_1_32=1, var_1_33=1, var_1_34=2, var_1_35=2, var_1_36=-256, var_1_37=-2147483647, var_1_38=1, var_1_39=-2147483647, var_1_40=-127, var_1_41=-127, var_1_42=0, var_1_43=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 148 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 694 mSDsluCounter, 1921 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 955 mSDsCounter, 351 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 357 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 351 mSolverCounterUnsat, 966 mSDtfsCounter, 357 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 742 GetRequests, 718 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=7, InterpolantAutomatonStates: 33, 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, 8 MinimizatonAttempts, 289 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2304 NumberOfCodeBlocks, 2304 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1935 ConstructedInterpolants, 0 QuantifiedInterpolants, 4296 SizeOfPredicates, 2 NumberOfNonLiveVariables, 1296 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 16380/16632 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-08 10:51:34,815 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-72.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 ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 10:51:36,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 10:51:36,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-08 10:51:36,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 10:51:36,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 10:51:36,786 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 10:51:36,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 10:51:36,787 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 10:51:36,787 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 10:51:36,787 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 10:51:36,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 10:51:36,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 10:51:36,788 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 10:51:36,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:36,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 10:51:36,789 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 10:51:36,789 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 -> ff43099396207f2e7f14a52467281e8d3219fba521ba1b291bba2029ae8f3105 [2025-03-08 10:51:37,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 10:51:37,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 10:51:37,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 10:51:37,016 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 10:51:37,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 10:51:37,019 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-72.i [2025-03-08 10:51:38,226 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6658a5b9/9b8f070b49c54b84966924a77dcec13b/FLAGa8f30082a [2025-03-08 10:51:38,421 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 10:51:38,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2025-03-08 10:51:38,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6658a5b9/9b8f070b49c54b84966924a77dcec13b/FLAGa8f30082a [2025-03-08 10:51:38,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6658a5b9/9b8f070b49c54b84966924a77dcec13b [2025-03-08 10:51:38,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 10:51:38,452 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 10:51:38,453 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:38,453 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 10:51:38,456 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 10:51:38,457 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f77a03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38, skipping insertion in model container [2025-03-08 10:51:38,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 10:51:38,580 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-72.i[915,928] [2025-03-08 10:51:38,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:38,661 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 10:51:38,669 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-72.i[915,928] [2025-03-08 10:51:38,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 10:51:38,728 INFO L204 MainTranslator]: Completed translation [2025-03-08 10:51:38,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38 WrapperNode [2025-03-08 10:51:38,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 10:51:38,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:38,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 10:51:38,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 10:51:38,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,780 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-03-08 10:51:38,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 10:51:38,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 10:51:38,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 10:51:38,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 10:51:38,789 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,806 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 10:51:38,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 10:51:38,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 10:51:38,840 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 10:51:38,840 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 10:51:38,841 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (1/1) ... [2025-03-08 10:51:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 10:51:38,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 10:51:38,868 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 10:51:38,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 10:51:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 10:51:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-08 10:51:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 10:51:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 10:51:38,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 10:51:38,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 10:51:38,953 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 10:51:38,955 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 10:51:46,709 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 10:51:46,710 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 10:51:46,720 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 10:51:46,721 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 10:51:46,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:46 BoogieIcfgContainer [2025-03-08 10:51:46,722 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 10:51:46,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 10:51:46,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 10:51:46,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 10:51:46,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:51:38" (1/3) ... [2025-03-08 10:51:46,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7df1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:46, skipping insertion in model container [2025-03-08 10:51:46,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:51:38" (2/3) ... [2025-03-08 10:51:46,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b7df1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:51:46, skipping insertion in model container [2025-03-08 10:51:46,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:51:46" (3/3) ... [2025-03-08 10:51:46,732 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i [2025-03-08 10:51:46,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 10:51:46,744 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-72.i that has 2 procedures, 76 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 10:51:46,783 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 10:51:46,790 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;@7fd3dbc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 10:51:46,791 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 10:51:46,793 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-08 10:51:46,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:46,802 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:46,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:46,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:46,806 INFO L85 PathProgramCache]: Analyzing trace with hash -905370026, now seen corresponding path program 1 times [2025-03-08 10:51:46,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:51:46,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261403727] [2025-03-08 10:51:46,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:46,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:51:46,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:51:46,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:51:46,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-08 10:51:46,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-08 10:51:47,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-08 10:51:47,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:47,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:47,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 10:51:47,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:47,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2025-03-08 10:51:47,315 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:47,316 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:51:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261403727] [2025-03-08 10:51:47,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261403727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:47,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 10:51:47,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423332594] [2025-03-08 10:51:47,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:47,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 10:51:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:51:47,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 10:51:47,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:47,335 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3111111111111111) internal successors, (59), 46 states have internal predecessors, (59), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:47,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:51:47,351 INFO L93 Difference]: Finished difference Result 146 states and 253 transitions. [2025-03-08 10:51:47,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 10:51:47,352 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-03-08 10:51:47,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:51:47,357 INFO L225 Difference]: With dead ends: 146 [2025-03-08 10:51:47,357 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 10:51:47,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 10:51:47,361 INFO L435 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 10:51:47,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 10:51:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 10:51:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-08 10:51:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 43 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-08 10:51:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 109 transitions. [2025-03-08 10:51:47,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 109 transitions. Word has length 175 [2025-03-08 10:51:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:51:47,394 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 109 transitions. [2025-03-08 10:51:47,394 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 10:51:47,395 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 109 transitions. [2025-03-08 10:51:47,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-08 10:51:47,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:51:47,397 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:51:47,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-08 10:51:47,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:51:47,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:51:47,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:51:47,600 INFO L85 PathProgramCache]: Analyzing trace with hash 89687985, now seen corresponding path program 1 times [2025-03-08 10:51:47,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:51:47,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283293053] [2025-03-08 10:51:47,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:51:47,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:51:47,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:51:47,604 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:51:47,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-08 10:51:47,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-08 10:51:47,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-08 10:51:47,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:51:47,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:51:48,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 10:51:48,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:51:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:51:51,355 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:51:51,355 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:51:51,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283293053] [2025-03-08 10:51:51,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [283293053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:51:51,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:51:51,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:51:51,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659876999] [2025-03-08 10:51:51,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:51:51,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:51:51,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:51:51,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:51:51,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:51:51,358 INFO L87 Difference]: Start difference. First operand 73 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:51:55,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:51:59,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:52:03,518 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-08 10:52:03,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:03,519 INFO L93 Difference]: Finished difference Result 222 states and 334 transitions. [2025-03-08 10:52:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:52:03,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 176 [2025-03-08 10:52:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:03,559 INFO L225 Difference]: With dead ends: 222 [2025-03-08 10:52:03,559 INFO L226 Difference]: Without dead ends: 152 [2025-03-08 10:52:03,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:52:03,561 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 69 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:03,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 314 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 18 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2025-03-08 10:52:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-08 10:52:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 126. [2025-03-08 10:52:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:52:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 190 transitions. [2025-03-08 10:52:03,588 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 190 transitions. Word has length 176 [2025-03-08 10:52:03,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:03,589 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 190 transitions. [2025-03-08 10:52:03,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:52:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 190 transitions. [2025-03-08 10:52:03,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-08 10:52:03,593 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:03,593 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:52:03,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-08 10:52:03,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:03,794 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:03,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:03,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1896447286, now seen corresponding path program 1 times [2025-03-08 10:52:03,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:52:03,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796773011] [2025-03-08 10:52:03,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:03,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:03,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:52:03,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:52:03,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-08 10:52:03,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-08 10:52:04,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-08 10:52:04,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:04,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:04,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 10:52:04,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:52:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-03-08 10:52:05,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 10:52:05,518 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:52:05,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796773011] [2025-03-08 10:52:05,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796773011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 10:52:05,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 10:52:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 10:52:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590342827] [2025-03-08 10:52:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 10:52:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 10:52:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:52:05,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 10:52:05,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 10:52:05,520 INFO L87 Difference]: Start difference. First operand 126 states and 190 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:52:09,789 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-08 10:52:11,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:52:15,656 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-08 10:52:15,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:15,657 INFO L93 Difference]: Finished difference Result 214 states and 321 transitions. [2025-03-08 10:52:15,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 10:52:15,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 177 [2025-03-08 10:52:15,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:15,704 INFO L225 Difference]: With dead ends: 214 [2025-03-08 10:52:15,704 INFO L226 Difference]: Without dead ends: 144 [2025-03-08 10:52:15,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 10:52:15,706 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 56 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:15,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2025-03-08 10:52:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-08 10:52:15,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 127. [2025-03-08 10:52:15,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 states have internal predecessors, (79), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:52:15,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 191 transitions. [2025-03-08 10:52:15,737 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 191 transitions. Word has length 177 [2025-03-08 10:52:15,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:15,737 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 191 transitions. [2025-03-08 10:52:15,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-03-08 10:52:15,737 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 191 transitions. [2025-03-08 10:52:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 10:52:15,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:15,741 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:52:15,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-08 10:52:15,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:15,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:15,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash 385483987, now seen corresponding path program 1 times [2025-03-08 10:52:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:52:15,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132523804] [2025-03-08 10:52:15,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:15,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:15,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:52:15,946 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:52:15,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-08 10:52:15,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 10:52:16,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 10:52:16,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:16,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:16,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 10:52:16,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:52:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-03-08 10:52:17,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 10:52:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 15 proven. 66 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-03-08 10:52:19,027 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-08 10:52:19,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132523804] [2025-03-08 10:52:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132523804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 10:52:19,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 10:52:19,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-08 10:52:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127435411] [2025-03-08 10:52:19,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 10:52:19,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 10:52:19,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-08 10:52:19,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 10:52:19,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 10:52:19,029 INFO L87 Difference]: Start difference. First operand 127 states and 191 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 10:52:24,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:52:28,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:52:32,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-08 10:52:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 10:52:32,339 INFO L93 Difference]: Finished difference Result 209 states and 307 transitions. [2025-03-08 10:52:32,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 10:52:32,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) Word has length 178 [2025-03-08 10:52:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 10:52:32,343 INFO L225 Difference]: With dead ends: 209 [2025-03-08 10:52:32,343 INFO L226 Difference]: Without dead ends: 139 [2025-03-08 10:52:32,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 348 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-08 10:52:32,344 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 56 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 16 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2025-03-08 10:52:32,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 182 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 168 Invalid, 3 Unknown, 0 Unchecked, 13.2s Time] [2025-03-08 10:52:32,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2025-03-08 10:52:32,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2025-03-08 10:52:32,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 74 states have (on average 1.135135135135135) internal successors, (84), 74 states have internal predecessors, (84), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-03-08 10:52:32,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2025-03-08 10:52:32,365 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 178 [2025-03-08 10:52:32,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 10:52:32,366 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2025-03-08 10:52:32,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 2 states have call predecessors, (51), 2 states have call successors, (51) [2025-03-08 10:52:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2025-03-08 10:52:32,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 10:52:32,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 10:52:32,367 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 10:52:32,381 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-08 10:52:32,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:32,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 10:52:32,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 10:52:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 188970482, now seen corresponding path program 1 times [2025-03-08 10:52:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-08 10:52:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793843740] [2025-03-08 10:52:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 10:52:32,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-08 10:52:32,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-08 10:52:32,571 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-08 10:52:32,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-08 10:52:32,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 10:52:32,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 10:52:32,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 10:52:32,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 10:52:32,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-08 10:52:32,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 10:52:49,868 WARN L286 SmtUtils]: Spent 6.18s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:52:57,940 WARN L286 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-08 10:53:05,823 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)