./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.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 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:59:33,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:59:33,408 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:59:33,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:59:33,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:59:33,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:59:33,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:59:33,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:59:33,438 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:59:33,438 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:59:33,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:59:33,439 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:59:33,439 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:59:33,439 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:59:33,440 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:59:33,440 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:59:33,441 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:33,441 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:59:33,441 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:59:33,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:59:33,442 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 -> 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 [2025-03-03 20:59:33,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:59:33,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:59:33,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:59:33,678 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:59:33,678 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:59:33,679 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-0.i [2025-03-03 20:59:34,814 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe3f263/95363f6c9540480fb2afd80dbb369452/FLAGc8a1ff12b [2025-03-03 20:59:35,048 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:59:35,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2025-03-03 20:59:35,055 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe3f263/95363f6c9540480fb2afd80dbb369452/FLAGc8a1ff12b [2025-03-03 20:59:35,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4fe3f263/95363f6c9540480fb2afd80dbb369452 [2025-03-03 20:59:35,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:59:35,390 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:59:35,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:35,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:59:35,394 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:59:35,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4110503e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35, skipping insertion in model container [2025-03-03 20:59:35,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,414 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:59:35,517 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i[918,931] [2025-03-03 20:59:35,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:35,582 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:59:35,591 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-0.i[918,931] [2025-03-03 20:59:35,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:35,648 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:59:35,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35 WrapperNode [2025-03-03 20:59:35,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:35,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:35,651 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:59:35,651 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:59:35,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,692 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2025-03-03 20:59:35,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:35,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:59:35,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:59:35,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:59:35,701 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,701 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,703 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,720 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:59:35,720 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,720 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,729 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,742 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:59:35,742 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:59:35,742 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:59:35,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:59:35,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (1/1) ... [2025-03-03 20:59:35,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:35,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:35,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:59:35,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:59:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:59:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:59:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:59:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:59:35,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:59:35,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:59:35,862 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:59:35,864 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:59:36,201 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 20:59:36,201 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:59:36,215 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:59:36,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:59:36,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:36 BoogieIcfgContainer [2025-03-03 20:59:36,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:59:36,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:59:36,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:59:36,221 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:59:36,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:59:35" (1/3) ... [2025-03-03 20:59:36,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb5cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:36, skipping insertion in model container [2025-03-03 20:59:36,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:35" (2/3) ... [2025-03-03 20:59:36,223 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdb5cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:59:36, skipping insertion in model container [2025-03-03 20:59:36,223 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:36" (3/3) ... [2025-03-03 20:59:36,224 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2025-03-03 20:59:36,233 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:59:36,235 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:59:36,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:59:36,281 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;@460caf94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:59:36,281 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:59:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 20:59:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:36,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:36,295 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:36,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:36,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash 603392309, now seen corresponding path program 1 times [2025-03-03 20:59:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184282242] [2025-03-03 20:59:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:36,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:36,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:36,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:36,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:36,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 20:59:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184282242] [2025-03-03 20:59:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184282242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:59:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890472183] [2025-03-03 20:59:36,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:36,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:36,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:36,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:59:36,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:59:36,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:36,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:36,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:36,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:36,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:59:36,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:59:36,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-03-03 20:59:36,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:59:36,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890472183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:36,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:59:36,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:59:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889226777] [2025-03-03 20:59:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:36,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:59:36,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:36,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:59:36,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:59:36,792 INFO L87 Difference]: Start difference. First operand has 96 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 64 states have internal predecessors, (90), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 20:59:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:36,815 INFO L93 Difference]: Finished difference Result 186 states and 325 transitions. [2025-03-03 20:59:36,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:59:36,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 198 [2025-03-03 20:59:36,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:36,824 INFO L225 Difference]: With dead ends: 186 [2025-03-03 20:59:36,824 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 20:59:36,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:59:36,830 INFO L435 NwaCegarLoop]: 142 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, 142 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-03 20:59:36,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:59:36,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 20:59:36,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-03 20:59:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 20:59:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 144 transitions. [2025-03-03 20:59:36,860 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 144 transitions. Word has length 198 [2025-03-03 20:59:36,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:36,861 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 144 transitions. [2025-03-03 20:59:36,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 20:59:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 144 transitions. [2025-03-03 20:59:36,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:36,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:36,863 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:36,870 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-03 20:59:37,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:59:37,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:37,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash -293015569, now seen corresponding path program 1 times [2025-03-03 20:59:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:37,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869655586] [2025-03-03 20:59:37,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:37,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:37,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:37,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:37,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:37,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:37,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869655586] [2025-03-03 20:59:37,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869655586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:37,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:37,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 20:59:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824019177] [2025-03-03 20:59:37,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:37,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 20:59:37,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:37,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 20:59:37,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 20:59:37,767 INFO L87 Difference]: Start difference. First operand 93 states and 144 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:38,592 INFO L93 Difference]: Finished difference Result 559 states and 871 transitions. [2025-03-03 20:59:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 20:59:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 20:59:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:38,601 INFO L225 Difference]: With dead ends: 559 [2025-03-03 20:59:38,601 INFO L226 Difference]: Without dead ends: 469 [2025-03-03 20:59:38,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2025-03-03 20:59:38,604 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 680 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:38,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1293 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:59:38,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2025-03-03 20:59:38,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 258. [2025-03-03 20:59:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 164 states have (on average 1.3841463414634145) internal successors, (227), 164 states have internal predecessors, (227), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 20:59:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 407 transitions. [2025-03-03 20:59:38,674 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 407 transitions. Word has length 198 [2025-03-03 20:59:38,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:38,674 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 407 transitions. [2025-03-03 20:59:38,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:38,675 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 407 transitions. [2025-03-03 20:59:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:38,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:38,676 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:38,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:59:38,679 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:38,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash -264386418, now seen corresponding path program 1 times [2025-03-03 20:59:38,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:38,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525269292] [2025-03-03 20:59:38,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:38,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:38,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:38,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:38,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:38,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:38,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525269292] [2025-03-03 20:59:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525269292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:38,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:59:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892370003] [2025-03-03 20:59:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:38,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:59:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:38,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:59:38,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:59:38,924 INFO L87 Difference]: Start difference. First operand 258 states and 407 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:39,116 INFO L93 Difference]: Finished difference Result 383 states and 603 transitions. [2025-03-03 20:59:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:59:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 20:59:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:39,119 INFO L225 Difference]: With dead ends: 383 [2025-03-03 20:59:39,119 INFO L226 Difference]: Without dead ends: 186 [2025-03-03 20:59:39,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:59:39,120 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 82 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:39,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 456 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:59:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-03 20:59:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2025-03-03 20:59:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 88 states have internal predecessors, (113), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 20:59:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 233 transitions. [2025-03-03 20:59:39,145 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 233 transitions. Word has length 198 [2025-03-03 20:59:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:39,145 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 233 transitions. [2025-03-03 20:59:39,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,146 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 233 transitions. [2025-03-03 20:59:39,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:39,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:39,147 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:59:39,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:39,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:39,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1963895438, now seen corresponding path program 1 times [2025-03-03 20:59:39,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409352219] [2025-03-03 20:59:39,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:39,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:39,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:39,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:39,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:39,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:39,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409352219] [2025-03-03 20:59:39,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409352219] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:39,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:39,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174947394] [2025-03-03 20:59:39,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:39,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:39,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:39,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:39,281 INFO L87 Difference]: Start difference. First operand 151 states and 233 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:39,400 INFO L93 Difference]: Finished difference Result 332 states and 517 transitions. [2025-03-03 20:59:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 20:59:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:39,403 INFO L225 Difference]: With dead ends: 332 [2025-03-03 20:59:39,403 INFO L226 Difference]: Without dead ends: 242 [2025-03-03 20:59:39,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:39,404 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 72 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:39,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 316 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:39,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-03-03 20:59:39,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2025-03-03 20:59:39,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 146 states have (on average 1.3287671232876712) internal successors, (194), 146 states have internal predecessors, (194), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 20:59:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 374 transitions. [2025-03-03 20:59:39,431 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 374 transitions. Word has length 198 [2025-03-03 20:59:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:39,432 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 374 transitions. [2025-03-03 20:59:39,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,432 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 374 transitions. [2025-03-03 20:59:39,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:39,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:39,435 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:59:39,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:39,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1992524589, now seen corresponding path program 1 times [2025-03-03 20:59:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:39,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615089964] [2025-03-03 20:59:39,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:39,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:39,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:39,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:39,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:39,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615089964] [2025-03-03 20:59:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615089964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:39,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:59:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48358932] [2025-03-03 20:59:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:59:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:59:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:59:39,578 INFO L87 Difference]: Start difference. First operand 240 states and 374 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:39,896 INFO L93 Difference]: Finished difference Result 633 states and 992 transitions. [2025-03-03 20:59:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:59:39,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 20:59:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:39,900 INFO L225 Difference]: With dead ends: 633 [2025-03-03 20:59:39,900 INFO L226 Difference]: Without dead ends: 454 [2025-03-03 20:59:39,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:59:39,903 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 209 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:39,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 372 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:59:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-03 20:59:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 282. [2025-03-03 20:59:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 188 states have (on average 1.4042553191489362) internal successors, (264), 188 states have internal predecessors, (264), 90 states have call successors, (90), 3 states have call predecessors, (90), 3 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-03-03 20:59:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 444 transitions. [2025-03-03 20:59:39,941 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 444 transitions. Word has length 198 [2025-03-03 20:59:39,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:39,944 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 444 transitions. [2025-03-03 20:59:39,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:39,945 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 444 transitions. [2025-03-03 20:59:39,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:39,947 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:39,947 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:39,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:59:39,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:39,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:39,950 INFO L85 PathProgramCache]: Analyzing trace with hash 195573230, now seen corresponding path program 1 times [2025-03-03 20:59:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:39,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501261437] [2025-03-03 20:59:39,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:39,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:40,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:40,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:40,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:40,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501261437] [2025-03-03 20:59:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501261437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455495244] [2025-03-03 20:59:40,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:40,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:40,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:40,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:40,295 INFO L87 Difference]: Start difference. First operand 282 states and 444 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:40,479 INFO L93 Difference]: Finished difference Result 795 states and 1257 transitions. [2025-03-03 20:59:40,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:40,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 198 [2025-03-03 20:59:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:40,483 INFO L225 Difference]: With dead ends: 795 [2025-03-03 20:59:40,483 INFO L226 Difference]: Without dead ends: 570 [2025-03-03 20:59:40,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:59:40,488 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 177 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:40,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 401 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-03 20:59:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 499. [2025-03-03 20:59:40,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 343 states have (on average 1.4285714285714286) internal successors, (490), 343 states have internal predecessors, (490), 150 states have call successors, (150), 5 states have call predecessors, (150), 5 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 20:59:40,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 790 transitions. [2025-03-03 20:59:40,548 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 790 transitions. Word has length 198 [2025-03-03 20:59:40,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:40,549 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 790 transitions. [2025-03-03 20:59:40,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:40,549 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 790 transitions. [2025-03-03 20:59:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 20:59:40,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:40,551 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:40,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:59:40,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:40,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:40,552 INFO L85 PathProgramCache]: Analyzing trace with hash 226593037, now seen corresponding path program 1 times [2025-03-03 20:59:40,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:40,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241395542] [2025-03-03 20:59:40,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:40,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:40,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:40,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:40,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:40,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 20:59:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241395542] [2025-03-03 20:59:40,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241395542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:59:40,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481011229] [2025-03-03 20:59:40,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:40,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:40,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:40,805 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:59:40,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:59:40,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 20:59:40,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 20:59:40,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:40,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:40,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:59:40,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:59:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 249 proven. 81 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2025-03-03 20:59:41,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:59:41,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 6 proven. 81 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 20:59:41,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481011229] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:59:41,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:59:41,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:59:41,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467401943] [2025-03-03 20:59:41,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:59:41,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:59:41,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:41,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:59:41,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:59:41,470 INFO L87 Difference]: Start difference. First operand 499 states and 790 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-03 20:59:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:41,677 INFO L93 Difference]: Finished difference Result 967 states and 1514 transitions. [2025-03-03 20:59:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:59:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) Word has length 198 [2025-03-03 20:59:41,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:41,681 INFO L225 Difference]: With dead ends: 967 [2025-03-03 20:59:41,681 INFO L226 Difference]: Without dead ends: 531 [2025-03-03 20:59:41,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 393 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:59:41,682 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 107 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:41,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 254 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:41,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2025-03-03 20:59:41,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2025-03-03 20:59:41,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 358 states have (on average 1.3435754189944134) internal successors, (481), 358 states have internal predecessors, (481), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2025-03-03 20:59:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 781 transitions. [2025-03-03 20:59:41,738 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 781 transitions. Word has length 198 [2025-03-03 20:59:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:41,739 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 781 transitions. [2025-03-03 20:59:41,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (57), 2 states have call predecessors, (57), 4 states have return successors, (58), 2 states have call predecessors, (58), 2 states have call successors, (58) [2025-03-03 20:59:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 781 transitions. [2025-03-03 20:59:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 20:59:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:41,740 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:41,747 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-03 20:59:41,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-03 20:59:41,942 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:41,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:41,943 INFO L85 PathProgramCache]: Analyzing trace with hash -452038925, now seen corresponding path program 1 times [2025-03-03 20:59:41,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:41,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492468274] [2025-03-03 20:59:41,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:41,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:41,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 20:59:41,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 20:59:41,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:42,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492468274] [2025-03-03 20:59:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492468274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:42,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 20:59:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415494802] [2025-03-03 20:59:42,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:42,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:59:42,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:59:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:59:42,129 INFO L87 Difference]: Start difference. First operand 519 states and 781 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:42,760 INFO L93 Difference]: Finished difference Result 1157 states and 1735 transitions. [2025-03-03 20:59:42,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 20:59:42,761 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2025-03-03 20:59:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:42,766 INFO L225 Difference]: With dead ends: 1157 [2025-03-03 20:59:42,766 INFO L226 Difference]: Without dead ends: 677 [2025-03-03 20:59:42,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2025-03-03 20:59:42,768 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 452 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:42,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 686 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:59:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-03 20:59:42,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 665. [2025-03-03 20:59:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 438 states have (on average 1.3036529680365296) internal successors, (571), 440 states have internal predecessors, (571), 210 states have call successors, (210), 16 states have call predecessors, (210), 16 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 20:59:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 991 transitions. [2025-03-03 20:59:42,850 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 991 transitions. Word has length 199 [2025-03-03 20:59:42,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:42,850 INFO L471 AbstractCegarLoop]: Abstraction has 665 states and 991 transitions. [2025-03-03 20:59:42,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 991 transitions. [2025-03-03 20:59:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-03 20:59:42,852 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:42,852 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:42,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:59:42,852 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:42,853 INFO L85 PathProgramCache]: Analyzing trace with hash -872845519, now seen corresponding path program 1 times [2025-03-03 20:59:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832522015] [2025-03-03 20:59:42,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:42,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-03 20:59:42,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-03 20:59:42,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:42,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:43,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:43,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832522015] [2025-03-03 20:59:43,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832522015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:43,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:43,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 20:59:43,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126839295] [2025-03-03 20:59:43,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:43,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 20:59:43,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:43,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 20:59:43,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:59:43,068 INFO L87 Difference]: Start difference. First operand 665 states and 991 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:43,367 INFO L93 Difference]: Finished difference Result 1379 states and 2055 transitions. [2025-03-03 20:59:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:59:43,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 199 [2025-03-03 20:59:43,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:43,375 INFO L225 Difference]: With dead ends: 1379 [2025-03-03 20:59:43,375 INFO L226 Difference]: Without dead ends: 781 [2025-03-03 20:59:43,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-03 20:59:43,378 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 167 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:43,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 486 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:59:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2025-03-03 20:59:43,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 668. [2025-03-03 20:59:43,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 441 states have (on average 1.3038548752834467) internal successors, (575), 443 states have internal predecessors, (575), 210 states have call successors, (210), 16 states have call predecessors, (210), 16 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 20:59:43,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 995 transitions. [2025-03-03 20:59:43,443 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 995 transitions. Word has length 199 [2025-03-03 20:59:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:43,443 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 995 transitions. [2025-03-03 20:59:43,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 995 transitions. [2025-03-03 20:59:43,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-03 20:59:43,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:43,447 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:59:43,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:43,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:43,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1211679408, now seen corresponding path program 1 times [2025-03-03 20:59:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846112692] [2025-03-03 20:59:43,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:43,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:43,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 20:59:43,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 20:59:43,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:43,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:43,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 20:59:43,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846112692] [2025-03-03 20:59:43,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846112692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:59:43,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636183710] [2025-03-03 20:59:43,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:43,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:43,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:43,626 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-03 20:59:43,628 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-03 20:59:43,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-03 20:59:43,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-03 20:59:43,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:43,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:43,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 20:59:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:59:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 843 proven. 54 refuted. 0 times theorem prover too weak. 843 trivial. 0 not checked. [2025-03-03 20:59:43,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:59:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 54 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-03-03 20:59:44,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636183710] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:59:44,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 20:59:44,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 20:59:44,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377650039] [2025-03-03 20:59:44,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 20:59:44,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:59:44,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:44,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:59:44,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:59:44,118 INFO L87 Difference]: Start difference. First operand 668 states and 995 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 20:59:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:44,358 INFO L93 Difference]: Finished difference Result 1326 states and 1943 transitions. [2025-03-03 20:59:44,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:59:44,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 200 [2025-03-03 20:59:44,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:44,363 INFO L225 Difference]: With dead ends: 1326 [2025-03-03 20:59:44,365 INFO L226 Difference]: Without dead ends: 726 [2025-03-03 20:59:44,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:59:44,367 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 138 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:44,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 226 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2025-03-03 20:59:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 692. [2025-03-03 20:59:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 458 states have (on average 1.259825327510917) internal successors, (577), 460 states have internal predecessors, (577), 210 states have call successors, (210), 23 states have call predecessors, (210), 23 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 20:59:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 997 transitions. [2025-03-03 20:59:44,439 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 997 transitions. Word has length 200 [2025-03-03 20:59:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:44,440 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 997 transitions. [2025-03-03 20:59:44,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2025-03-03 20:59:44,440 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 997 transitions. [2025-03-03 20:59:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 20:59:44,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:44,442 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:44,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 20:59:44,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:44,643 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:44,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:44,644 INFO L85 PathProgramCache]: Analyzing trace with hash -827352325, now seen corresponding path program 1 times [2025-03-03 20:59:44,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:44,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853625536] [2025-03-03 20:59:44,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:44,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:44,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 20:59:44,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 20:59:44,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:44,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:59:44,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 20:59:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:59:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853625536] [2025-03-03 20:59:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853625536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:59:44,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:59:44,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:59:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728853597] [2025-03-03 20:59:44,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:59:44,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:59:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:59:44,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:59:44,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:59:44,733 INFO L87 Difference]: Start difference. First operand 692 states and 997 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:59:44,892 INFO L93 Difference]: Finished difference Result 1312 states and 1893 transitions. [2025-03-03 20:59:44,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:59:44,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 202 [2025-03-03 20:59:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:59:44,897 INFO L225 Difference]: With dead ends: 1312 [2025-03-03 20:59:44,897 INFO L226 Difference]: Without dead ends: 694 [2025-03-03 20:59:44,898 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-03 20:59:44,899 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 62 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:59:44,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 305 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:59:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-03 20:59:44,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2025-03-03 20:59:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 458 states have (on average 1.2510917030567685) internal successors, (573), 460 states have internal predecessors, (573), 210 states have call successors, (210), 23 states have call predecessors, (210), 23 states have return successors, (210), 208 states have call predecessors, (210), 210 states have call successors, (210) [2025-03-03 20:59:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 993 transitions. [2025-03-03 20:59:44,955 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 993 transitions. Word has length 202 [2025-03-03 20:59:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:59:44,956 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 993 transitions. [2025-03-03 20:59:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 20:59:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 993 transitions. [2025-03-03 20:59:44,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-03 20:59:44,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:59:44,958 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:44,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:59:44,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:59:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:59:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -798723174, now seen corresponding path program 1 times [2025-03-03 20:59:44,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:59:44,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173531826] [2025-03-03 20:59:44,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:59:44,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 20:59:45,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 20:59:45,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:59:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [255845307] [2025-03-03 20:59:45,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:59:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:45,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:45,057 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-03 20:59:45,059 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-03 20:59:45,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 20:59:45,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 20:59:45,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:45,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:59:45,207 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:59:45,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-03 20:59:45,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-03 20:59:45,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:59:45,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:59:45,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:59:45,385 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:59:45,386 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:59:45,395 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-03 20:59:45,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:59:45,594 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:59:45,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:59:45,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:59:45 BoogieIcfgContainer [2025-03-03 20:59:45,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:59:45,718 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:59:45,718 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:59:45,718 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:59:45,718 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:59:36" (3/4) ... [2025-03-03 20:59:45,720 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:59:45,720 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:59:45,721 INFO L158 Benchmark]: Toolchain (without parser) took 10330.79ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 113.0MB in the beginning and 196.8MB in the end (delta: -83.9MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2025-03-03 20:59:45,721 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:59:45,721 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.32ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:59:45,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.25ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:59:45,722 INFO L158 Benchmark]: Boogie Preprocessor took 48.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 91.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:59:45,722 INFO L158 Benchmark]: IcfgBuilder took 473.68ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 64.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 20:59:45,722 INFO L158 Benchmark]: TraceAbstraction took 9499.23ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 63.6MB in the beginning and 200.0MB in the end (delta: -136.4MB). Peak memory consumption was 683.2kB. Max. memory is 16.1GB. [2025-03-03 20:59:45,722 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 285.2MB. Free memory was 200.0MB in the beginning and 196.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:59:45,723 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.14ms. Allocated memory is still 226.5MB. Free memory is still 146.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.32ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 97.0MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.25ms. Allocated memory is still 142.6MB. Free memory was 97.0MB in the beginning and 94.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.17ms. Allocated memory is still 142.6MB. Free memory was 94.1MB in the beginning and 91.0MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 473.68ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 64.1MB in the end (delta: 26.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9499.23ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 63.6MB in the beginning and 200.0MB in the end (delta: -136.4MB). Peak memory consumption was 683.2kB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 285.2MB. Free memory was 200.0MB in the beginning and 196.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 79, overapproximation of someBinaryFLOATComparisonOperation at line 150, overapproximation of someBinaryFLOATComparisonOperation at line 148, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 79, overapproximation of bitwiseAnd at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 156, overapproximation of someBinaryDOUBLEComparisonOperation at line 146. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 0; [L23] signed long int var_1_5 = 2; [L24] signed short int var_1_6 = -10; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned long int var_1_9 = 3470417420; [L28] unsigned char var_1_10 = 0; [L29] double var_1_12 = 25.6; [L30] double var_1_13 = 1.75; [L31] float var_1_14 = 5.4; [L32] float var_1_15 = 127.5; [L33] float var_1_16 = 3.5; [L34] signed long int var_1_17 = 64; [L35] double var_1_19 = 0.0; [L36] unsigned short int var_1_20 = 10; [L37] double var_1_21 = 4.75; [L38] double var_1_22 = 4.6; [L39] unsigned char var_1_23 = 0; [L40] signed long int var_1_28 = 8; [L41] signed long int var_1_30 = 5; [L42] signed long int var_1_31 = 100; [L43] float var_1_34 = 31.8; [L44] unsigned char var_1_35 = 0; [L45] unsigned char var_1_36 = 0; [L46] unsigned long int var_1_37 = 1; [L47] signed long int var_1_38 = 500; [L48] unsigned long int var_1_39 = 2882328056; [L49] unsigned short int var_1_40 = 5; [L50] unsigned short int var_1_41 = 2; [L51] unsigned short int var_1_42 = 50; [L52] unsigned short int var_1_43 = 4; [L53] unsigned char var_1_44 = 0; [L54] signed long int last_1_var_1_1 = 0; [L55] signed long int last_1_var_1_5 = 2; [L56] signed short int last_1_var_1_6 = -10; [L57] unsigned long int last_1_var_1_7 = 1; [L58] float last_1_var_1_14 = 5.4; [L59] signed long int last_1_var_1_17 = 64; VAL [isInitial=0, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L185] last_1_var_1_1 = var_1_1 [L186] last_1_var_1_5 = var_1_5 [L187] last_1_var_1_6 = var_1_6 [L188] last_1_var_1_7 = var_1_7 [L189] last_1_var_1_14 = var_1_14 [L190] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=3470417420] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_ulong() [L137] CALL assume_abort_if_not(var_1_9 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L137] RET assume_abort_if_not(var_1_9 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L138] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L138] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=0, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L140] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_12=128/5, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L142] var_1_12 = __VERIFIER_nondet_double() [L143] CALL assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L143] RET assume_abort_if_not((var_1_12 >= -922337.2036854776000e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L144] CALL assume_abort_if_not(var_1_12 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L144] RET assume_abort_if_not(var_1_12 != 0.0F) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_13=7/4, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L145] var_1_13 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L146] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_15=255/2, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L147] var_1_15 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L148] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_16=7/2, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L149] var_1_16 = __VERIFIER_nondet_float() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=10, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L151] var_1_20 = __VERIFIER_nondet_ushort() [L152] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L152] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L153] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L153] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L154] CALL assume_abort_if_not(var_1_20 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L154] RET assume_abort_if_not(var_1_20 != 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_21=19/4, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_22=23/5, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L158] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=5, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L159] var_1_30 = __VERIFIER_nondet_long() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L161] CALL assume_abort_if_not(var_1_30 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L161] RET assume_abort_if_not(var_1_30 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=100, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L162] var_1_31 = __VERIFIER_nondet_long() [L163] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L163] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L164] CALL assume_abort_if_not(var_1_31 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L164] RET assume_abort_if_not(var_1_31 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L165] var_1_36 = __VERIFIER_nondet_uchar() [L166] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L166] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L167] CALL assume_abort_if_not(var_1_36 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L167] RET assume_abort_if_not(var_1_36 <= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=500, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L168] var_1_38 = __VERIFIER_nondet_long() [L169] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L169] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L170] CALL assume_abort_if_not(var_1_38 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L170] RET assume_abort_if_not(var_1_38 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2882328056, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L171] var_1_39 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_39 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L172] RET assume_abort_if_not(var_1_39 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L173] CALL assume_abort_if_not(var_1_39 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L173] RET assume_abort_if_not(var_1_39 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=2, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L174] var_1_41 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_41 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L175] RET assume_abort_if_not(var_1_41 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L176] CALL assume_abort_if_not(var_1_41 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L176] RET assume_abort_if_not(var_1_41 <= 32767) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=50, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L177] var_1_42 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L178] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L179] CALL assume_abort_if_not(var_1_42 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L179] RET assume_abort_if_not(var_1_42 <= 16384) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=4, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L180] var_1_43 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L181] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L182] CALL assume_abort_if_not(var_1_43 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L182] RET assume_abort_if_not(var_1_43 <= 16383) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L201] RET updateVariables() [L202] CALL step() [L63] COND FALSE !(last_1_var_1_7 > (- last_1_var_1_5)) [L66] var_1_1 = (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=5, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L68] var_1_40 = (var_1_41 + (var_1_42 + var_1_43)) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=64, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L69] COND FALSE !(((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) [L72] var_1_17 = last_1_var_1_6 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L74] signed long int stepLocal_1 = - last_1_var_1_1; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_1=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L75] COND FALSE !(last_1_var_1_17 < stepLocal_1) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=0, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L78] COND TRUE (32 / var_1_20) > -500 [L79] var_1_19 = ((((var_1_21 - var_1_22) < 0 ) ? -(var_1_21 - var_1_22) : (var_1_21 - var_1_22))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L81] COND TRUE \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L82] COND TRUE var_1_10 && (1 >= var_1_17) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=0, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L83] COND TRUE \read(var_1_10) [L84] var_1_23 = var_1_10 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L88] COND TRUE (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - (var_1_20 + var_1_38)) <= var_1_1 [L89] var_1_37 = ((((var_1_30) > (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31)))))) ? (var_1_30) : (((((var_1_38) < ((var_1_39 - var_1_31))) ? (var_1_38) : ((var_1_39 - var_1_31))))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L91] signed long int stepLocal_3 = var_1_1; [L92] signed long int stepLocal_2 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_2=-10, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L93] COND FALSE !(var_1_17 > stepLocal_2) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L98] unsigned long int stepLocal_5 = var_1_9; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=27/5, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L99] COND FALSE !((var_1_12 * last_1_var_1_14) > var_1_13) [L106] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L108] EXPR var_1_20 & var_1_1 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=8, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L108] COND TRUE (var_1_20 & var_1_1) >= var_1_1 [L109] var_1_28 = (((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) < 0 ) ? -((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) : ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))))) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L115] signed long int stepLocal_0 = var_1_17; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_0=-10, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L116] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L119] unsigned long int stepLocal_4 = var_1_9 - var_1_6; VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_4=2147483657, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L120] COND TRUE (- 8u) >= stepLocal_4 [L121] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=159/5, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L125] COND TRUE var_1_31 > var_1_1 [L126] var_1_34 = var_1_22 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L128] EXPR var_1_20 & -100 VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L128] COND FALSE !((var_1_20 & -100) <= var_1_6) [L131] COND TRUE var_1_7 <= var_1_6 [L132] var_1_44 = ((1 >= var_1_17) && var_1_36) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, stepLocal_3=0, stepLocal_5=2147483647, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((last_1_var_1_7 > (- last_1_var_1_5)) ? (var_1_1 == ((signed long int) ((((last_1_var_1_5) > ((last_1_var_1_7 + last_1_var_1_6))) ? (last_1_var_1_5) : ((last_1_var_1_7 + last_1_var_1_6)))))) : (var_1_1 == ((signed long int) (((((1 - last_1_var_1_7)) < (16)) ? ((1 - last_1_var_1_7)) : (16)))))) && ((var_1_6 < var_1_17) ? (var_1_5 == ((signed long int) ((var_1_17 - var_1_6) + var_1_6))) : 1)) && ((last_1_var_1_17 < (- last_1_var_1_1)) ? (var_1_6 == ((signed short int) (32 - last_1_var_1_6))) : 1)) && ((var_1_17 > var_1_17) ? ((var_1_6 <= var_1_1) ? (var_1_7 == ((unsigned long int) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : 1) : 1)) && (((- 8u) >= (var_1_9 - var_1_6)) ? (var_1_8 == ((unsigned char) (! var_1_10))) : (var_1_8 == ((unsigned char) (((var_1_14 / var_1_12) >= var_1_14) || var_1_10))))) && (((var_1_12 * last_1_var_1_14) > var_1_13) ? ((var_1_9 < var_1_7) ? (var_1_14 == ((float) var_1_15)) : (var_1_14 == ((float) var_1_15))) : (var_1_14 == ((float) var_1_16)))) && ((((last_1_var_1_14 + last_1_var_1_14) / 9.2) < ((((last_1_var_1_14) < (var_1_16)) ? (last_1_var_1_14) : (var_1_16)))) ? (var_1_17 == ((signed long int) ((((last_1_var_1_1) > (last_1_var_1_6)) ? (last_1_var_1_1) : (last_1_var_1_6))))) : (var_1_17 == ((signed long int) last_1_var_1_6))) ; VAL [\result=0, isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=27/5, last_1_var_1_17=64, last_1_var_1_1=0, last_1_var_1_5=2, last_1_var_1_6=-10, last_1_var_1_7=1, var_1_10=1, var_1_14=3, var_1_16=3, var_1_17=-10, var_1_19=2, var_1_1=0, var_1_20=32, var_1_22=4, var_1_23=1, var_1_28=32, var_1_30=0, var_1_31=2147483646, var_1_34=4, var_1_35=0, var_1_36=0, var_1_37=1, var_1_38=1073741823, var_1_39=2147483647, var_1_40=0, var_1_41=0, var_1_42=0, var_1_43=0, var_1_44=0, var_1_5=2, var_1_6=-10, var_1_7=1, var_1_8=0, var_1_9=2147483647] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 12, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2157 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2146 mSDsluCounter, 4937 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3259 mSDsCounter, 993 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2550 IncrementalHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 993 mSolverCounterUnsat, 1678 mSDtfsCounter, 2550 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1090 GetRequests, 1017 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=692occurred in iteration=10, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 664 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 3186 NumberOfCodeBlocks, 3186 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3164 ConstructedInterpolants, 0 QuantifiedInterpolants, 8127 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1426 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 27377/27840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:59:45,744 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-0.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 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:59:47,532 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:59:47,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:59:47,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:59:47,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:59:47,665 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:59:47,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:59:47,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:59:47,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:59:47,667 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:59:47,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:59:47,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:59:47,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:59:47,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:59:47,668 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:59:47,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:59:47,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:59:47,669 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:59:47,670 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:59:47,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:59:47,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:59:47,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:59:47,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:59:47,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:47,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:59:47,671 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:59:47,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:59:47,672 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 -> 02302d5e48bc44c6f124efc94463f9a2f0c0da50c9e87269aada61f7681b5a41 [2025-03-03 20:59:47,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:59:47,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:59:47,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:59:47,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:59:47,939 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:59:47,940 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-0.i [2025-03-03 20:59:49,089 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564e7c4c0/055392de65bf425f94f29f58cfca6061/FLAGa04bb5ac9 [2025-03-03 20:59:49,314 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:59:49,318 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2025-03-03 20:59:49,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564e7c4c0/055392de65bf425f94f29f58cfca6061/FLAGa04bb5ac9 [2025-03-03 20:59:49,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/564e7c4c0/055392de65bf425f94f29f58cfca6061 [2025-03-03 20:59:49,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:59:49,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:59:49,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:49,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:59:49,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:59:49,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e60d505 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49, skipping insertion in model container [2025-03-03 20:59:49,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,681 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:59:49,774 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-0.i[918,931] [2025-03-03 20:59:49,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:49,835 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:59:49,843 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-0.i[918,931] [2025-03-03 20:59:49,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:59:49,880 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:59:49,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49 WrapperNode [2025-03-03 20:59:49,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:59:49,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:49,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:59:49,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:59:49,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,894 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,921 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2025-03-03 20:59:49,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:59:49,923 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:59:49,923 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:59:49,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:59:49,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,929 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,941 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:59:49,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:59:49,961 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:59:49,961 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:59:49,961 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:59:49,962 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (1/1) ... [2025-03-03 20:59:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:59:49,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:59:49,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:59:49,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:59:50,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:59:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:59:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:59:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:59:50,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:59:50,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:59:50,102 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:59:50,104 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:00:15,043 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-03-03 21:00:15,043 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:00:15,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:00:15,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:00:15,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:15 BoogieIcfgContainer [2025-03-03 21:00:15,052 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:00:15,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:00:15,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:00:15,056 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:00:15,056 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:59:49" (1/3) ... [2025-03-03 21:00:15,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55066e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:15, skipping insertion in model container [2025-03-03 21:00:15,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:59:49" (2/3) ... [2025-03-03 21:00:15,057 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55066e7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:00:15, skipping insertion in model container [2025-03-03 21:00:15,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:00:15" (3/3) ... [2025-03-03 21:00:15,058 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i [2025-03-03 21:00:15,067 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:00:15,068 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-0.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:00:15,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:00:15,107 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;@4d88f9e2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:00:15,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:00:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 21:00:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 21:00:15,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:15,119 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:00:15,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:15,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:15,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1603278496, now seen corresponding path program 1 times [2025-03-03 21:00:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341369645] [2025-03-03 21:00:15,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:15,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:00:15,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:15,132 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:00:15,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 21:00:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 21:00:16,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 21:00:16,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:16,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:16,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:00:16,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2025-03-03 21:00:16,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:16,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:16,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341369645] [2025-03-03 21:00:16,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341369645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:16,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:16,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:00:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143359655] [2025-03-03 21:00:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:16,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:00:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:16,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:00:16,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:00:16,729 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 21:00:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:00:16,748 INFO L93 Difference]: Finished difference Result 174 states and 305 transitions. [2025-03-03 21:00:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:00:16,750 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 196 [2025-03-03 21:00:16,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:00:16,754 INFO L225 Difference]: With dead ends: 174 [2025-03-03 21:00:16,754 INFO L226 Difference]: Without dead ends: 87 [2025-03-03 21:00:16,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:00:16,757 INFO L435 NwaCegarLoop]: 134 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, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:00:16,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:00:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-03 21:00:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-03-03 21:00:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 55 states have internal predecessors, (74), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-03 21:00:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2025-03-03 21:00:16,788 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 196 [2025-03-03 21:00:16,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:00:16,788 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2025-03-03 21:00:16,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-03-03 21:00:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2025-03-03 21:00:16,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 21:00:16,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:00:16,793 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:00:16,832 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-03 21:00:16,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:00:16,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:00:16,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:00:16,995 INFO L85 PathProgramCache]: Analyzing trace with hash 98580122, now seen corresponding path program 1 times [2025-03-03 21:00:16,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:00:16,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135953427] [2025-03-03 21:00:16,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:00:16,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:00:16,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:00:16,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:00:16,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 21:00:17,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 21:00:18,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 21:00:18,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:00:18,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:00:18,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:00:18,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:00:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 21:00:37,443 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:00:37,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:00:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135953427] [2025-03-03 21:00:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135953427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:00:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:00:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:00:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573547296] [2025-03-03 21:00:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:00:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:00:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:00:37,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:00:37,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:00:37,445 INFO L87 Difference]: Start difference. First operand 87 states and 134 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 21:00:42,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:00:46,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:00:50,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:00:55,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.61s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:01:00,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:01:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:01:00,022 INFO L93 Difference]: Finished difference Result 274 states and 424 transitions. [2025-03-03 21:01:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:01:00,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2025-03-03 21:01:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:01:00,314 INFO L225 Difference]: With dead ends: 274 [2025-03-03 21:01:00,314 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 21:01:00,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:01:00,315 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 130 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 61 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.3s IncrementalHoareTripleChecker+Time [2025-03-03 21:01:00,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 392 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 16 Invalid, 5 Unknown, 0 Unchecked, 22.3s Time] [2025-03-03 21:01:00,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 21:01:00,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 169. [2025-03-03 21:01:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 106 states have (on average 1.349056603773585) internal successors, (143), 106 states have internal predecessors, (143), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:01:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 263 transitions. [2025-03-03 21:01:00,345 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 263 transitions. Word has length 196 [2025-03-03 21:01:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:01:00,346 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 263 transitions. [2025-03-03 21:01:00,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-03-03 21:01:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 263 transitions. [2025-03-03 21:01:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 21:01:00,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:01:00,353 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:01:00,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 21:01:00,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:01:00,553 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:01:00,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:01:00,554 INFO L85 PathProgramCache]: Analyzing trace with hash 31573369, now seen corresponding path program 1 times [2025-03-03 21:01:00,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:01:00,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066708865] [2025-03-03 21:01:00,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:01:00,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 21:01:00,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:01:00,557 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 21:01:00,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 21:01:00,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-03-03 21:01:02,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-03-03 21:01:02,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:01:02,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:01:02,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:01:02,162 INFO L279 TraceCheckSpWp]: Computing forward predicates...