./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:29:44,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:29:44,269 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 01:29:44,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:29:44,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:29:44,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:29:44,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:29:44,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:29:44,303 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:29:44,303 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:29:44,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:29:44,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:29:44,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:29:44,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:29:44,304 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:29:44,305 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:29:44,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:29:44,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:29:44,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:29:44,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:29:44,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:29:44,307 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2025-03-17 01:29:44,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:29:44,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:29:44,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:29:44,571 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:29:44,571 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:29:44,572 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:29:45,729 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e084330d/32c1bad672be4927b846c55e79048331/FLAGff32edd19 [2025-03-17 01:29:46,014 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:29:46,015 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:29:46,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e084330d/32c1bad672be4927b846c55e79048331/FLAGff32edd19 [2025-03-17 01:29:46,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e084330d/32c1bad672be4927b846c55e79048331 [2025-03-17 01:29:46,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:29:46,325 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:29:46,326 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:29:46,326 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:29:46,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:29:46,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e02eb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46, skipping insertion in model container [2025-03-17 01:29:46,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:29:46,453 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-03-17 01:29:46,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:29:46,530 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:29:46,539 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-03-17 01:29:46,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:29:46,593 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:29:46,593 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46 WrapperNode [2025-03-17 01:29:46,594 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:29:46,596 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:29:46,596 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:29:46,597 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:29:46,602 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,655 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-03-17 01:29:46,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:29:46,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:29:46,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:29:46,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:29:46,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,673 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,693 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-17 01:29:46,694 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,706 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:29:46,720 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:29:46,720 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:29:46,721 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:29:46,722 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (1/1) ... [2025-03-17 01:29:46,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:29:46,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:46,752 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-17 01:29:46,760 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-17 01:29:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:29:46,778 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:29:46,778 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:29:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 01:29:46,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:29:46,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:29:46,859 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:29:46,861 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:29:47,184 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:29:47,184 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:29:47,202 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:29:47,202 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:29:47,203 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:47 BoogieIcfgContainer [2025-03-17 01:29:47,203 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:29:47,205 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:29:47,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:29:47,208 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:29:47,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:29:46" (1/3) ... [2025-03-17 01:29:47,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e48c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:47, skipping insertion in model container [2025-03-17 01:29:47,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:29:46" (2/3) ... [2025-03-17 01:29:47,209 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36e48c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:29:47, skipping insertion in model container [2025-03-17 01:29:47,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:47" (3/3) ... [2025-03-17 01:29:47,210 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:29:47,221 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:29:47,222 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i that has 2 procedures, 89 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:29:47,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:29:47,280 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;@609f7d43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:29:47,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:29:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:29:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:47,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:47,293 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:47,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:47,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:47,297 INFO L85 PathProgramCache]: Analyzing trace with hash 969774438, now seen corresponding path program 1 times [2025-03-17 01:29:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:47,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745546495] [2025-03-17 01:29:47,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:47,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:47,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:47,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:47,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:47,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 01:29:47,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:47,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745546495] [2025-03-17 01:29:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745546495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16649714] [2025-03-17 01:29:47,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:47,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:47,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:47,592 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-17 01:29:47,594 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-17 01:29:47,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:47,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:47,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:47,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:47,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:29:47,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:47,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2025-03-17 01:29:47,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:29:47,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16649714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:47,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:29:47,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 01:29:47,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314671481] [2025-03-17 01:29:47,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:47,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:29:47,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:47,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:29:47,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:29:47,863 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4727272727272727) internal successors, (81), 56 states have internal predecessors, (81), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:29:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:47,895 INFO L93 Difference]: Finished difference Result 172 states and 309 transitions. [2025-03-17 01:29:47,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:29:47,898 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 192 [2025-03-17 01:29:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:47,904 INFO L225 Difference]: With dead ends: 172 [2025-03-17 01:29:47,905 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 01:29:47,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 193 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-17 01:29:47,913 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:47,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:29:47,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 01:29:47,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-17 01:29:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:29:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 132 transitions. [2025-03-17 01:29:47,962 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 132 transitions. Word has length 192 [2025-03-17 01:29:47,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:47,962 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 132 transitions. [2025-03-17 01:29:47,962 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, (31), 2 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:29:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 132 transitions. [2025-03-17 01:29:47,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:47,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:47,966 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:47,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-17 01:29:48,168 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-17 01:29:48,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:48,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -554896445, now seen corresponding path program 1 times [2025-03-17 01:29:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:48,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375528690] [2025-03-17 01:29:48,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:48,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:48,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:48,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:48,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:48,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:29:48,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:48,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375528690] [2025-03-17 01:29:48,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375528690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:48,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:48,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:29:48,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028470493] [2025-03-17 01:29:48,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:48,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:29:48,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:48,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:29:48,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:29:48,510 INFO L87 Difference]: Start difference. First operand 84 states and 132 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:48,741 INFO L93 Difference]: Finished difference Result 216 states and 339 transitions. [2025-03-17 01:29:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:29:48,744 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:29:48,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:48,747 INFO L225 Difference]: With dead ends: 216 [2025-03-17 01:29:48,747 INFO L226 Difference]: Without dead ends: 133 [2025-03-17 01:29:48,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:29:48,750 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 67 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:48,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 385 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:29:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-17 01:29:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2025-03-17 01:29:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 49 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-17 01:29:48,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2025-03-17 01:29:48,776 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 192 [2025-03-17 01:29:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:48,778 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 202 transitions. [2025-03-17 01:29:48,778 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2025-03-17 01:29:48,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:48,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:48,781 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:48,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 01:29:48,781 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:48,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:48,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1932616388, now seen corresponding path program 1 times [2025-03-17 01:29:48,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:48,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329814761] [2025-03-17 01:29:48,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:48,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:48,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:48,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:48,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:48,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:29:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329814761] [2025-03-17 01:29:49,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329814761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:49,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:29:49,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685143496] [2025-03-17 01:29:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:49,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:29:49,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:49,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:29:49,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:29:49,068 INFO L87 Difference]: Start difference. First operand 130 states and 202 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:49,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:49,260 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2025-03-17 01:29:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:29:49,260 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:29:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:49,265 INFO L225 Difference]: With dead ends: 359 [2025-03-17 01:29:49,267 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 01:29:49,268 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-17 01:29:49,270 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 93 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:49,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 369 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 01:29:49,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 01:29:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 184. [2025-03-17 01:29:49,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 100 states have (on average 1.26) internal successors, (126), 101 states have internal predecessors, (126), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:29:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 286 transitions. [2025-03-17 01:29:49,311 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 286 transitions. Word has length 192 [2025-03-17 01:29:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:49,311 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 286 transitions. [2025-03-17 01:29:49,311 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 286 transitions. [2025-03-17 01:29:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:49,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:49,313 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:49,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 01:29:49,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:49,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash 935544035, now seen corresponding path program 1 times [2025-03-17 01:29:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756136344] [2025-03-17 01:29:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:49,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:49,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:49,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:49,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:49,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:29:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756136344] [2025-03-17 01:29:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756136344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:29:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:29:49,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 01:29:49,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511224146] [2025-03-17 01:29:49,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:29:49,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:29:49,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:49,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:29:49,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:29:49,547 INFO L87 Difference]: Start difference. First operand 184 states and 286 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:49,648 INFO L93 Difference]: Finished difference Result 391 states and 608 transitions. [2025-03-17 01:29:49,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:29:49,649 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 192 [2025-03-17 01:29:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:49,654 INFO L225 Difference]: With dead ends: 391 [2025-03-17 01:29:49,654 INFO L226 Difference]: Without dead ends: 262 [2025-03-17 01:29:49,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-17 01:29:49,656 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 153 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:49,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 426 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 01:29:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-17 01:29:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 202. [2025-03-17 01:29:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 119 states have internal predecessors, (155), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:29:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 315 transitions. [2025-03-17 01:29:49,700 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 315 transitions. Word has length 192 [2025-03-17 01:29:49,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:49,701 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 315 transitions. [2025-03-17 01:29:49,701 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:29:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 315 transitions. [2025-03-17 01:29:49,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:49,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:49,704 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:49,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 01:29:49,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:49,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2006113564, now seen corresponding path program 1 times [2025-03-17 01:29:49,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:49,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627924179] [2025-03-17 01:29:49,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:49,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:49,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:49,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:49,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:49,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:50,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:29:50,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:50,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627924179] [2025-03-17 01:29:50,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627924179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:50,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034995483] [2025-03-17 01:29:50,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:50,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:50,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:50,035 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-17 01:29:50,037 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-17 01:29:50,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:50,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:50,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:29:50,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 926 proven. 60 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked. [2025-03-17 01:29:50,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:29:51,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034995483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:29:51,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:29:51,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2025-03-17 01:29:51,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942032732] [2025-03-17 01:29:51,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:29:51,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 01:29:51,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:51,220 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 01:29:51,220 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:29:51,221 INFO L87 Difference]: Start difference. First operand 202 states and 315 transitions. Second operand has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-17 01:29:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:51,845 INFO L93 Difference]: Finished difference Result 476 states and 700 transitions. [2025-03-17 01:29:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 01:29:51,846 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) Word has length 192 [2025-03-17 01:29:51,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:51,848 INFO L225 Difference]: With dead ends: 476 [2025-03-17 01:29:51,848 INFO L226 Difference]: Without dead ends: 334 [2025-03-17 01:29:51,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2025-03-17 01:29:51,850 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 308 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:51,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 275 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:29:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-03-17 01:29:51,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 320. [2025-03-17 01:29:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 209 states have (on average 1.2727272727272727) internal successors, (266), 212 states have internal predecessors, (266), 96 states have call successors, (96), 14 states have call predecessors, (96), 14 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2025-03-17 01:29:51,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 458 transitions. [2025-03-17 01:29:51,894 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 458 transitions. Word has length 192 [2025-03-17 01:29:51,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:51,894 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 458 transitions. [2025-03-17 01:29:51,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.923076923076923) internal successors, (103), 12 states have internal predecessors, (103), 7 states have call successors, (73), 3 states have call predecessors, (73), 5 states have return successors, (75), 7 states have call predecessors, (75), 7 states have call successors, (75) [2025-03-17 01:29:51,895 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 458 transitions. [2025-03-17 01:29:51,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 01:29:51,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:51,897 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:51,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 01:29:52,101 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-17 01:29:52,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1977484413, now seen corresponding path program 1 times [2025-03-17 01:29:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421170301] [2025-03-17 01:29:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:52,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:52,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:52,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:52,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:29:52,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421170301] [2025-03-17 01:29:52,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421170301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:52,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290904662] [2025-03-17 01:29:52,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:52,484 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-17 01:29:52,486 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-17 01:29:52,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 01:29:52,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 01:29:52,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:52,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:52,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 01:29:52,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-17 01:29:53,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 54 proven. 123 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2025-03-17 01:29:53,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290904662] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:29:53,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:29:53,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-17 01:29:53,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759664115] [2025-03-17 01:29:53,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:29:53,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 01:29:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:53,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 01:29:53,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-03-17 01:29:53,412 INFO L87 Difference]: Start difference. First operand 320 states and 458 transitions. Second operand has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-03-17 01:29:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:53,867 INFO L93 Difference]: Finished difference Result 503 states and 698 transitions. [2025-03-17 01:29:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 01:29:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) Word has length 192 [2025-03-17 01:29:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:53,871 INFO L225 Difference]: With dead ends: 503 [2025-03-17 01:29:53,871 INFO L226 Difference]: Without dead ends: 268 [2025-03-17 01:29:53,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2025-03-17 01:29:53,874 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 146 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:53,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 217 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 01:29:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-17 01:29:53,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 227. [2025-03-17 01:29:53,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 143 states have (on average 1.2097902097902098) internal successors, (173), 144 states have internal predecessors, (173), 70 states have call successors, (70), 13 states have call predecessors, (70), 13 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-03-17 01:29:53,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2025-03-17 01:29:53,905 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 192 [2025-03-17 01:29:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:53,906 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2025-03-17 01:29:53,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 6 states have call successors, (75), 3 states have call predecessors, (75), 7 states have return successors, (76), 6 states have call predecessors, (76), 6 states have call successors, (76) [2025-03-17 01:29:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2025-03-17 01:29:53,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:29:53,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:53,908 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:53,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 01:29:54,108 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-17 01:29:54,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:54,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:54,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1730123712, now seen corresponding path program 1 times [2025-03-17 01:29:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:54,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297578960] [2025-03-17 01:29:54,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:54,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:54,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:29:54,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:29:54,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:54,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 30 proven. 60 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:29:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 01:29:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297578960] [2025-03-17 01:29:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297578960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:29:54,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13977501] [2025-03-17 01:29:54,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:29:54,555 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-17 01:29:54,556 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-17 01:29:54,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:29:54,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:29:54,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:54,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:29:54,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 01:29:54,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:29:54,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-03-17 01:29:54,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:29:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:29:54,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13977501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:29:54,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 01:29:54,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 11 [2025-03-17 01:29:54,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230761238] [2025-03-17 01:29:54,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 01:29:54,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:29:54,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 01:29:54,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:29:54,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:29:54,939 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-03-17 01:29:56,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:29:56,009 INFO L93 Difference]: Finished difference Result 613 states and 834 transitions. [2025-03-17 01:29:56,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 01:29:56,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) Word has length 194 [2025-03-17 01:29:56,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:29:56,013 INFO L225 Difference]: With dead ends: 613 [2025-03-17 01:29:56,015 INFO L226 Difference]: Without dead ends: 466 [2025-03-17 01:29:56,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 387 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=301, Invalid=755, Unknown=0, NotChecked=0, Total=1056 [2025-03-17 01:29:56,017 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 419 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:29:56,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 388 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 01:29:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-03-17 01:29:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 378. [2025-03-17 01:29:56,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 245 states have (on average 1.2040816326530612) internal successors, (295), 247 states have internal predecessors, (295), 109 states have call successors, (109), 23 states have call predecessors, (109), 23 states have return successors, (109), 107 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-17 01:29:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 513 transitions. [2025-03-17 01:29:56,065 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 513 transitions. Word has length 194 [2025-03-17 01:29:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:29:56,065 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 513 transitions. [2025-03-17 01:29:56,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 5 states have call successors, (69), 2 states have call predecessors, (69), 4 states have return successors, (70), 5 states have call predecessors, (70), 5 states have call successors, (70) [2025-03-17 01:29:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 513 transitions. [2025-03-17 01:29:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-17 01:29:56,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:29:56,067 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:29:56,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 01:29:56,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 01:29:56,268 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:29:56,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:29:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -221648382, now seen corresponding path program 1 times [2025-03-17 01:29:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 01:29:56,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535811516] [2025-03-17 01:29:56,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:29:56,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 01:29:56,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:29:56,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:29:56,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:56,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:29:56,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 01:29:56,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-17 01:29:56,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-17 01:29:56,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:29:56,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 01:29:56,462 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 01:29:56,462 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 01:29:56,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 01:29:56,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 01:29:56,467 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 01:29:56,594 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 01:29:56,598 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 01:29:56 BoogieIcfgContainer [2025-03-17 01:29:56,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 01:29:56,600 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 01:29:56,600 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 01:29:56,600 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 01:29:56,600 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:29:47" (3/4) ... [2025-03-17 01:29:56,602 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 01:29:56,603 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 01:29:56,604 INFO L158 Benchmark]: Toolchain (without parser) took 10279.10ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 121.9MB in the beginning and 163.8MB in the end (delta: -42.0MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2025-03-17 01:29:56,604 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:29:56,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.25ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 01:29:56,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.20ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:29:56,605 INFO L158 Benchmark]: Boogie Preprocessor took 60.66ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 97.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 01:29:56,605 INFO L158 Benchmark]: IcfgBuilder took 482.79ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 71.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 01:29:56,605 INFO L158 Benchmark]: TraceAbstraction took 9394.21ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 70.9MB in the beginning and 163.9MB in the end (delta: -93.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:29:56,606 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 251.7MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 01:29:56,607 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.25ms. Allocated memory is still 201.3MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.25ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 106.7MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.20ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.0MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.66ms. Allocated memory is still 167.8MB. Free memory was 103.0MB in the beginning and 97.7MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 482.79ms. Allocated memory is still 167.8MB. Free memory was 97.7MB in the beginning and 71.4MB in the end (delta: 26.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9394.21ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 70.9MB in the beginning and 163.9MB in the end (delta: -93.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 251.7MB. Free memory was 163.9MB in the beginning and 163.8MB in the end (delta: 55.4kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 179. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 16; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 1; [L25] signed char var_1_8 = -10; [L26] unsigned short int var_1_9 = 4; [L27] signed char var_1_10 = 8; [L28] unsigned short int var_1_12 = 64314; [L29] unsigned short int var_1_13 = 26169; [L30] signed char var_1_17 = 50; [L31] signed char var_1_18 = 16; [L32] signed char var_1_19 = 5; [L33] signed char var_1_20 = 0; [L34] signed char var_1_21 = 50; [L35] signed char var_1_22 = 16; [L36] unsigned char var_1_23 = 16; [L37] unsigned char var_1_24 = 1; [L38] unsigned char var_1_25 = 0; [L39] double var_1_27 = 0.25; [L40] double var_1_28 = 10.25; [L41] double var_1_29 = 1000.25; [L42] double var_1_30 = 9.5; [L43] float var_1_31 = 63.5; [L44] unsigned short int var_1_32 = 16; [L45] unsigned char var_1_40 = 1; [L46] unsigned char var_1_43 = 0; [L47] signed long int var_1_44 = -4; [L48] unsigned long int var_1_46 = 4; [L49] unsigned long int var_1_49 = 3576445681; [L50] double var_1_50 = 32.5; [L51] signed long int var_1_52 = -1; [L52] unsigned short int var_1_53 = 64; [L53] unsigned short int last_1_var_1_9 = 4; [L183] isInitial = 1 [L184] FCALL initially() [L185] COND TRUE 1 [L186] CALL updateLastVariables() [L176] last_1_var_1_9 = var_1_9 [L186] RET updateLastVariables() [L187] CALL updateVariables() [L126] var_1_4 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L127] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L128] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L129] var_1_6 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L130] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_8=-10, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L131] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=-10, var_1_9=4] [L132] var_1_8 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L133] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L134] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=8, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L135] var_1_10 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L136] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L137] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=64314, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L138] var_1_12 = __VERIFIER_nondet_ushort() [L139] CALL assume_abort_if_not(var_1_12 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L139] RET assume_abort_if_not(var_1_12 >= 49150) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L140] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=26169, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L141] var_1_13 = __VERIFIER_nondet_ushort() [L142] CALL assume_abort_if_not(var_1_13 >= 24575) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L142] RET assume_abort_if_not(var_1_13 >= 24575) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L143] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=16, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L144] var_1_18 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_18 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L145] RET assume_abort_if_not(var_1_18 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L146] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=5, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L147] var_1_19 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_19 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L148] RET assume_abort_if_not(var_1_19 >= -1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L149] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L150] var_1_20 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L151] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L152] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=50, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L153] var_1_21 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_21 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L154] RET assume_abort_if_not(var_1_21 >= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L155] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=16, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L156] var_1_22 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_22 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L158] RET assume_abort_if_not(var_1_22 <= 31) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L159] var_1_25 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L160] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L161] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_28=41/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L162] var_1_28 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L163] RET assume_abort_if_not((var_1_28 >= -230584.3009213691390e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 2305843.009213691390e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_29=4001/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L164] var_1_29 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L165] RET assume_abort_if_not((var_1_29 >= -230584.3009213691390e+13F && var_1_29 <= -1.0e-20F) || (var_1_29 <= 2305843.009213691390e+12F && var_1_29 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=19/2, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L166] var_1_30 = __VERIFIER_nondet_double() [L167] CALL assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L167] RET assume_abort_if_not((var_1_30 >= -461168.6018427382800e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=0, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L169] RET assume_abort_if_not(var_1_43 >= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] CALL assume_abort_if_not(var_1_43 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L170] RET assume_abort_if_not(var_1_43 <= 1) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=3576445681, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L171] var_1_49 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_49 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L172] RET assume_abort_if_not(var_1_49 >= 2147483647) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] CALL assume_abort_if_not(var_1_49 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L173] RET assume_abort_if_not(var_1_49 <= 4294967294) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L187] RET updateVariables() [L188] CALL step() [L57] COND FALSE !((- last_1_var_1_9) < (last_1_var_1_9 + -500)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L60] COND FALSE !(var_1_21 <= var_1_9) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=50, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=65/2, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L63] var_1_50 = var_1_30 [L64] var_1_17 = (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L65] COND TRUE (var_1_13 <= var_1_12) || var_1_25 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L66] COND TRUE ((((5) < 0 ) ? -(5) : (5))) < var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L67] COND FALSE !(\read(var_1_25)) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=64, var_1_6=1, var_1_8=126, var_1_9=4] [L72] var_1_53 = var_1_22 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L73] COND TRUE \read(var_1_4) [L74] var_1_24 = (! var_1_25) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=127/2, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L78] var_1_31 = var_1_30 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=16, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L79] COND FALSE !(var_1_23 < var_1_23) [L90] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] EXPR (~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L92] COND FALSE !(((~ var_1_21) >> ((((var_1_22) > (var_1_22)) ? (var_1_22) : (var_1_22)))) >= var_1_12) [L95] signed char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_9=4, stepLocal_0=126, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=4] [L96] COND FALSE !(stepLocal_0 < (-1 - var_1_10)) [L103] var_1_9 = var_1_13 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=-1, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] [L105] COND FALSE !((~ var_1_18) > var_1_13) [L108] var_1_52 = ((((var_1_10) < (var_1_21)) ? (var_1_10) : (var_1_21))) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=1/4, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] [L110] COND FALSE !(var_1_9 < (var_1_21 + var_1_23)) [L113] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] [L115] COND FALSE !(((((4) < 0 ) ? -(4) : (4))) >= var_1_21) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] [L188] RET step() [L189] CALL, EXPR property() [L179-L180] return (((((((var_1_23 < var_1_23) ? ((var_1_24 && var_1_24) ? (var_1_24 ? ((var_1_24 && (var_1_24 || var_1_24)) ? (var_1_1 == ((signed char) -5)) : 1) : 1) : (var_1_1 == ((signed char) var_1_8))) : (var_1_1 == ((signed char) var_1_8))) && ((var_1_1 < (-1 - var_1_10)) ? (var_1_24 ? (var_1_9 == ((unsigned short int) (var_1_10 + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))))) : (var_1_9 == ((unsigned short int) ((var_1_12 - var_1_10) - ((var_1_13 - var_1_23) - ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23)))))))) : (var_1_9 == ((unsigned short int) var_1_13)))) && (var_1_17 == ((signed char) (((((var_1_18) < (var_1_19)) ? (var_1_18) : (var_1_19))) - (var_1_20 + (var_1_21 - var_1_22)))))) && (((- last_1_var_1_9) < (last_1_var_1_9 + -500)) ? (var_1_23 == ((unsigned char) var_1_20)) : 1)) && (var_1_4 ? (var_1_24 == ((unsigned char) (! var_1_25))) : (var_1_24 == ((unsigned char) (var_1_6 && ((var_1_10 >= var_1_17) && var_1_25)))))) && ((var_1_9 < (var_1_21 + var_1_23)) ? (var_1_27 == ((double) ((var_1_28 + var_1_29) + var_1_30))) : (var_1_27 == ((double) var_1_28)))) && (var_1_31 == ((float) var_1_30)) ; [L189] RET, EXPR property() [L189] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] [L19] reach_error() VAL [isInitial=1, last_1_var_1_9=4, var_1_10=31, var_1_12=-1612513282, var_1_13=24575, var_1_17=4, var_1_18=36, var_1_19=35, var_1_1=126, var_1_20=0, var_1_21=31, var_1_22=0, var_1_23=16, var_1_24=1, var_1_25=0, var_1_27=3576445686, var_1_28=3576445686, var_1_30=3576445687, var_1_31=3576445687, var_1_32=16, var_1_40=1, var_1_43=1, var_1_44=-4, var_1_46=4, var_1_49=2147483647, var_1_4=1, var_1_50=3576445687, var_1_52=31, var_1_53=0, var_1_6=1, var_1_8=126, var_1_9=24575] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 174 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1211 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1186 mSDsluCounter, 2190 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1355 mSDsCounter, 507 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1644 IncrementalHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 507 mSolverCounterUnsat, 835 mSDtfsCounter, 1644 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1438 GetRequests, 1349 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=378occurred in iteration=7, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 252 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2310 NumberOfCodeBlocks, 2310 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2680 ConstructedInterpolants, 0 QuantifiedInterpolants, 8966 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1756 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 25383/26040 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-17 01:29:56,636 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_fillercodestructure_filler-pr-ci_file-96.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 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 01:29:58,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 01:29:58,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 01:29:58,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 01:29:58,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 01:29:58,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 01:29:58,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 01:29:58,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 01:29:58,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 01:29:58,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 01:29:58,638 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 01:29:58,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 01:29:58,638 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 01:29:58,639 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:29:58,639 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 01:29:58,639 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 01:29:58,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 01:29:58,640 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 -> 8725ca15b6ba01e824b857cb643dcbf1a334f302cf4671dbc0203866c02c86e4 [2025-03-17 01:29:58,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 01:29:58,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 01:29:58,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 01:29:58,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 01:29:58,908 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 01:29:58,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:30:00,044 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19076f3b/95854ffd77f945eea280218bc148d933/FLAGd0eee0235 [2025-03-17 01:30:00,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 01:30:00,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:30:00,304 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19076f3b/95854ffd77f945eea280218bc148d933/FLAGd0eee0235 [2025-03-17 01:30:00,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d19076f3b/95854ffd77f945eea280218bc148d933 [2025-03-17 01:30:00,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 01:30:00,331 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 01:30:00,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 01:30:00,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 01:30:00,337 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 01:30:00,338 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,339 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c7b5b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00, skipping insertion in model container [2025-03-17 01:30:00,339 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 01:30:00,452 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-03-17 01:30:00,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:30:00,535 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 01:30:00,543 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_fillercodestructure_filler-pr-ci_file-96.i[919,932] [2025-03-17 01:30:00,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 01:30:00,600 INFO L204 MainTranslator]: Completed translation [2025-03-17 01:30:00,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00 WrapperNode [2025-03-17 01:30:00,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 01:30:00,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 01:30:00,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 01:30:00,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 01:30:00,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,636 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2025-03-17 01:30:00,636 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 01:30:00,636 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 01:30:00,636 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 01:30:00,636 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 01:30:00,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,654 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-17 01:30:00,655 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,664 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 01:30:00,672 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 01:30:00,672 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 01:30:00,672 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 01:30:00,673 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (1/1) ... [2025-03-17 01:30:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 01:30:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 01:30:00,705 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-17 01:30:00,709 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-17 01:30:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 01:30:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 01:30:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 01:30:00,728 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 01:30:00,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 01:30:00,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 01:30:00,821 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 01:30:00,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 01:30:04,500 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 01:30:04,500 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 01:30:04,510 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 01:30:04,510 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 01:30:04,510 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:30:04 BoogieIcfgContainer [2025-03-17 01:30:04,510 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 01:30:04,512 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 01:30:04,512 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 01:30:04,515 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 01:30:04,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 01:30:00" (1/3) ... [2025-03-17 01:30:04,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ba59c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:30:04, skipping insertion in model container [2025-03-17 01:30:04,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 01:30:00" (2/3) ... [2025-03-17 01:30:04,516 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ba59c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 01:30:04, skipping insertion in model container [2025-03-17 01:30:04,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 01:30:04" (3/3) ... [2025-03-17 01:30:04,517 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i [2025-03-17 01:30:04,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 01:30:04,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-96.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 01:30:04,574 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 01:30:04,582 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;@5578038, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 01:30:04,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 01:30:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:30:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:30:04,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:04,595 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:04,596 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:04,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:04,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1108494927, now seen corresponding path program 1 times [2025-03-17 01:30:04,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:04,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833496395] [2025-03-17 01:30:04,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:04,608 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-17 01:30:04,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:04,611 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-17 01:30:04,612 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-17 01:30:04,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:04,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:04,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:04,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:04,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 01:30:04,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:04,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 924 proven. 0 refuted. 0 times theorem prover too weak. 936 trivial. 0 not checked. [2025-03-17 01:30:04,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:30:04,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:04,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833496395] [2025-03-17 01:30:04,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833496395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:30:04,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:30:04,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 01:30:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295274476] [2025-03-17 01:30:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:30:04,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 01:30:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:05,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 01:30:05,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 01:30:05,009 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:30:05,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:05,036 INFO L93 Difference]: Finished difference Result 160 states and 289 transitions. [2025-03-17 01:30:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 01:30:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 191 [2025-03-17 01:30:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:05,042 INFO L225 Difference]: With dead ends: 160 [2025-03-17 01:30:05,043 INFO L226 Difference]: Without dead ends: 78 [2025-03-17 01:30:05,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 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-17 01:30:05,050 INFO L435 NwaCegarLoop]: 122 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, 122 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-17 01:30:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 01:30:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-17 01:30:05,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-17 01:30:05,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 01:30:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 122 transitions. [2025-03-17 01:30:05,090 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 122 transitions. Word has length 191 [2025-03-17 01:30:05,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:05,091 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 122 transitions. [2025-03-17 01:30:05,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-17 01:30:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 122 transitions. [2025-03-17 01:30:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:30:05,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:05,095 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:05,107 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-17 01:30:05,295 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-17 01:30:05,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:05,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:05,297 INFO L85 PathProgramCache]: Analyzing trace with hash -326161326, now seen corresponding path program 1 times [2025-03-17 01:30:05,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:05,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615363157] [2025-03-17 01:30:05,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:05,298 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-17 01:30:05,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:05,301 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-17 01:30:05,303 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-17 01:30:05,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:05,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:05,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:05,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:05,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:30:05,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:30:06,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:30:06,405 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615363157] [2025-03-17 01:30:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615363157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:30:06,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 01:30:06,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 01:30:06,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130455078] [2025-03-17 01:30:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:30:06,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:30:06,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:06,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:30:06,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 01:30:06,408 INFO L87 Difference]: Start difference. First operand 78 states and 122 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:07,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:09,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:10,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:10,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:10,831 INFO L93 Difference]: Finished difference Result 233 states and 365 transitions. [2025-03-17 01:30:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 01:30:10,854 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2025-03-17 01:30:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:10,856 INFO L225 Difference]: With dead ends: 233 [2025-03-17 01:30:10,856 INFO L226 Difference]: Without dead ends: 156 [2025-03-17 01:30:10,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 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-17 01:30:10,857 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 77 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 01:30:10,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 345 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 01:30:10,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-17 01:30:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 132. [2025-03-17 01:30:10,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 67 states have internal predecessors, (82), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-17 01:30:10,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 206 transitions. [2025-03-17 01:30:10,886 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 206 transitions. Word has length 191 [2025-03-17 01:30:10,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:10,887 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 206 transitions. [2025-03-17 01:30:10,887 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 206 transitions. [2025-03-17 01:30:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:30:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:10,891 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:10,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-17 01:30:11,092 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-17 01:30:11,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1027148371, now seen corresponding path program 1 times [2025-03-17 01:30:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002991022] [2025-03-17 01:30:11,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:11,094 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-17 01:30:11,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:11,096 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-17 01:30:11,097 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-17 01:30:11,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:11,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:11,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:11,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:11,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:30:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-17 01:30:12,530 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:30:12,893 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002991022] [2025-03-17 01:30:12,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002991022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:30:12,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1960153045] [2025-03-17 01:30:12,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:12,894 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:30:12,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:30:12,896 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:30:12,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-03-17 01:30:12,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:13,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:13,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:13,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:13,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-17 01:30:13,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:30:13,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:30:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1960153045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:30:13,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:30:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-17 01:30:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731839692] [2025-03-17 01:30:13,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:30:13,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 01:30:13,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:13,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 01:30:13,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:30:13,517 INFO L87 Difference]: Start difference. First operand 132 states and 206 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:15,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:16,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:18,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:18,734 INFO L93 Difference]: Finished difference Result 253 states and 394 transitions. [2025-03-17 01:30:18,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 01:30:18,736 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2025-03-17 01:30:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:18,738 INFO L225 Difference]: With dead ends: 253 [2025-03-17 01:30:18,738 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 01:30:18,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:30:18,739 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 60 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:30:18,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 272 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 01:30:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 01:30:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2025-03-17 01:30:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 90 states have internal predecessors, (109), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:30:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 269 transitions. [2025-03-17 01:30:18,762 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 269 transitions. Word has length 191 [2025-03-17 01:30:18,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:18,762 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 269 transitions. [2025-03-17 01:30:18,762 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 269 transitions. [2025-03-17 01:30:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:30:18,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:18,769 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:18,779 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-17 01:30:18,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2025-03-17 01:30:19,170 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 01:30:19,170 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:19,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:19,170 INFO L85 PathProgramCache]: Analyzing trace with hash -780306092, now seen corresponding path program 1 times [2025-03-17 01:30:19,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:19,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985773838] [2025-03-17 01:30:19,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:19,171 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-17 01:30:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:19,173 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-17 01:30:19,174 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-17 01:30:19,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:19,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:19,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:19,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:19,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:30:19,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:20,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-17 01:30:20,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:30:20,642 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985773838] [2025-03-17 01:30:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985773838] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:30:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1084280427] [2025-03-17 01:30:20,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:20,642 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:30:20,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:30:20,647 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:30:20,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2025-03-17 01:30:20,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:21,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:21,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:21,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:21,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 01:30:21,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2025-03-17 01:30:21,823 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 01:30:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1084280427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 01:30:21,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 01:30:21,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-17 01:30:21,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403516708] [2025-03-17 01:30:21,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 01:30:21,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 01:30:21,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:21,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 01:30:21,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-03-17 01:30:21,825 INFO L87 Difference]: Start difference. First operand 173 states and 269 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:22,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:27,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:27,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:27,458 INFO L93 Difference]: Finished difference Result 359 states and 558 transitions. [2025-03-17 01:30:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 01:30:27,459 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 191 [2025-03-17 01:30:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:27,465 INFO L225 Difference]: With dead ends: 359 [2025-03-17 01:30:27,465 INFO L226 Difference]: Without dead ends: 241 [2025-03-17 01:30:27,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 495 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-17 01:30:27,467 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 107 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-03-17 01:30:27,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 418 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-03-17 01:30:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-03-17 01:30:27,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 189. [2025-03-17 01:30:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 105 states have (on average 1.2857142857142858) internal successors, (135), 106 states have internal predecessors, (135), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-17 01:30:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 295 transitions. [2025-03-17 01:30:27,500 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 295 transitions. Word has length 191 [2025-03-17 01:30:27,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:27,502 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 295 transitions. [2025-03-17 01:30:27,502 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, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2025-03-17 01:30:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 295 transitions. [2025-03-17 01:30:27,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-17 01:30:27,506 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:27,507 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:27,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2025-03-17 01:30:27,718 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 (6)] Ended with exit code 0 [2025-03-17 01:30:27,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 01:30:27,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:27,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:27,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1290840269, now seen corresponding path program 1 times [2025-03-17 01:30:27,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:27,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1875022575] [2025-03-17 01:30:27,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:27,908 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-17 01:30:27,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:27,910 INFO L229 MonitoredProcess]: Starting monitored process 8 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-17 01:30:27,912 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 (8)] Waiting until timeout for monitored process [2025-03-17 01:30:27,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:28,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:28,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:28,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:28,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:30:28,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:28,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 930 proven. 120 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2025-03-17 01:30:28,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:30:29,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1875022575] [2025-03-17 01:30:29,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1875022575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:30:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1582031679] [2025-03-17 01:30:29,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:29,076 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 01:30:29,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 01:30:29,078 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 01:30:29,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-03-17 01:30:29,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 01:30:29,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 01:30:29,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:29,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:29,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 01:30:29,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 850 proven. 60 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-03-17 01:30:30,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:30:30,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1582031679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 01:30:30,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:30:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2025-03-17 01:30:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111648381] [2025-03-17 01:30:30,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:30:30,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 01:30:30,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 01:30:30,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-03-17 01:30:30,502 INFO L87 Difference]: Start difference. First operand 189 states and 295 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-17 01:30:33,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:36,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:39,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-17 01:30:40,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:40,053 INFO L93 Difference]: Finished difference Result 484 states and 679 transitions. [2025-03-17 01:30:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-17 01:30:40,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) Word has length 191 [2025-03-17 01:30:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:40,057 INFO L225 Difference]: With dead ends: 484 [2025-03-17 01:30:40,057 INFO L226 Difference]: Without dead ends: 355 [2025-03-17 01:30:40,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 556 GetRequests, 514 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 01:30:40,059 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 145 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-17 01:30:40,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 331 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-17 01:30:40,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-03-17 01:30:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 296. [2025-03-17 01:30:40,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 175 states have (on average 1.1257142857142857) internal successors, (197), 177 states have internal predecessors, (197), 98 states have call successors, (98), 22 states have call predecessors, (98), 22 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 01:30:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 393 transitions. [2025-03-17 01:30:40,087 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 393 transitions. Word has length 191 [2025-03-17 01:30:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:40,087 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 393 transitions. [2025-03-17 01:30:40,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 4 states have call successors, (53), 4 states have call predecessors, (53), 6 states have return successors, (54), 4 states have call predecessors, (54), 4 states have call successors, (54) [2025-03-17 01:30:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 393 transitions. [2025-03-17 01:30:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:30:40,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:40,089 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:40,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2025-03-17 01:30:40,299 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 (8)] Ended with exit code 0 [2025-03-17 01:30:40,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /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-17 01:30:40,490 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:40,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:40,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1351755735, now seen corresponding path program 1 times [2025-03-17 01:30:40,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:40,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663772036] [2025-03-17 01:30:40,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:40,491 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-17 01:30:40,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:40,493 INFO L229 MonitoredProcess]: Starting monitored process 10 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-17 01:30:40,493 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 (10)] Waiting until timeout for monitored process [2025-03-17 01:30:40,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:30:40,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:30:40,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:40,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:40,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 01:30:40,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 01:30:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 720 proven. 21 refuted. 0 times theorem prover too weak. 1119 trivial. 0 not checked. [2025-03-17 01:30:40,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 01:30:41,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 69 proven. 21 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2025-03-17 01:30:41,109 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 01:30:41,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663772036] [2025-03-17 01:30:41,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663772036] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 01:30:41,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 01:30:41,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-17 01:30:41,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268363034] [2025-03-17 01:30:41,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 01:30:41,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 01:30:41,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 01:30:41,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 01:30:41,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 01:30:41,110 INFO L87 Difference]: Start difference. First operand 296 states and 393 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, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 01:30:43,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-17 01:30:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 01:30:43,378 INFO L93 Difference]: Finished difference Result 532 states and 697 transitions. [2025-03-17 01:30:43,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 01:30:43,400 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, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 193 [2025-03-17 01:30:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 01:30:43,402 INFO L225 Difference]: With dead ends: 532 [2025-03-17 01:30:43,402 INFO L226 Difference]: Without dead ends: 316 [2025-03-17 01:30:43,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 378 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 01:30:43,405 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 103 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-17 01:30:43,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 173 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-17 01:30:43,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-03-17 01:30:43,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 304. [2025-03-17 01:30:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 181 states have (on average 1.1104972375690607) internal successors, (201), 183 states have internal predecessors, (201), 98 states have call successors, (98), 24 states have call predecessors, (98), 24 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-17 01:30:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 397 transitions. [2025-03-17 01:30:43,431 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 397 transitions. Word has length 193 [2025-03-17 01:30:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 01:30:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 397 transitions. [2025-03-17 01:30:43,432 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, (38), 2 states have call predecessors, (38), 4 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-17 01:30:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 397 transitions. [2025-03-17 01:30:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-17 01:30:43,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 01:30:43,433 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 01:30:43,443 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 (10)] Ended with exit code 0 [2025-03-17 01:30:43,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-17 01:30:43,634 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 01:30:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 01:30:43,635 INFO L85 PathProgramCache]: Analyzing trace with hash 846197110, now seen corresponding path program 1 times [2025-03-17 01:30:43,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 01:30:43,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422878400] [2025-03-17 01:30:43,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 01:30:43,635 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-17 01:30:43,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 01:30:43,637 INFO L229 MonitoredProcess]: Starting monitored process 11 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-17 01:30:43,638 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 (11)] Waiting until timeout for monitored process [2025-03-17 01:30:43,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-17 01:30:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-17 01:30:43,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 01:30:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 01:30:43,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-17 01:30:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates...