./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:41:10,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:41:10,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:41:10,777 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:41:10,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:41:10,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:41:10,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:41:10,806 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:41:10,807 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:41:10,807 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:41:10,808 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:41:10,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:41:10,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:41:10,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:41:10,809 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:41:10,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:41:10,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:41:10,809 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:41:10,810 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:41:10,811 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:41:10,811 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:41:10,811 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:41:10,811 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:41:10,811 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:41:10,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:41:10,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:41:10,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:41:10,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:41:10,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:41:10,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:41:10,813 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-jdk21/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 -> 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 [2025-02-05 22:41:11,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:41:11,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:41:11,118 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:41:11,119 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:41:11,119 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:41:11,121 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:12,442 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1769789ed/376c480493f7454689abe21449513eb2/FLAG3801f5efe [2025-02-05 22:41:12,719 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:41:12,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:12,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1769789ed/376c480493f7454689abe21449513eb2/FLAG3801f5efe [2025-02-05 22:41:12,750 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1769789ed/376c480493f7454689abe21449513eb2 [2025-02-05 22:41:12,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:41:12,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:41:12,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:41:12,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:41:12,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:41:12,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:41:12" (1/1) ... [2025-02-05 22:41:12,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38180e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:12, skipping insertion in model container [2025-02-05 22:41:12,765 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:41:12" (1/1) ... [2025-02-05 22:41:12,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:41:12,906 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2025-02-05 22:41:12,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:41:13,000 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:41:13,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2025-02-05 22:41:13,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:41:13,073 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:41:13,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13 WrapperNode [2025-02-05 22:41:13,074 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:41:13,075 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:41:13,075 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:41:13,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:41:13,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,125 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 222 [2025-02-05 22:41:13,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:41:13,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:41:13,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:41:13,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:41:13,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,162 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-02-05 22:41:13,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,168 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,172 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,175 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:41:13,180 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:41:13,181 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:41:13,181 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:41:13,181 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (1/1) ... [2025-02-05 22:41:13,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:41:13,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:41:13,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:41:13,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:41:13,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:41:13,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:41:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:41:13,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:41:13,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:41:13,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:41:13,312 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:41:13,313 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:41:13,624 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:41:13,624 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:41:13,640 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:41:13,640 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:41:13,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:41:13 BoogieIcfgContainer [2025-02-05 22:41:13,641 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:41:13,643 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:41:13,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:41:13,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:41:13,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:41:12" (1/3) ... [2025-02-05 22:41:13,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6c42e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:41:13, skipping insertion in model container [2025-02-05 22:41:13,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:13" (2/3) ... [2025-02-05 22:41:13,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6c42e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:41:13, skipping insertion in model container [2025-02-05 22:41:13,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:41:13" (3/3) ... [2025-02-05 22:41:13,651 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:13,663 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:41:13,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:41:13,721 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:41:13,732 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;@20b6039b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:41:13,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:41:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 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-02-05 22:41:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:41:13,755 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:13,755 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] [2025-02-05 22:41:13,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 164409113, now seen corresponding path program 1 times [2025-02-05 22:41:13,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:13,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955375683] [2025-02-05 22:41:13,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:13,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:41:13,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:41:13,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:13,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:41:14,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:41:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955375683] [2025-02-05 22:41:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955375683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:41:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923036541] [2025-02-05 22:41:14,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:14,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:41:14,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:41:14,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:41:14,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 22:41:14,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:41:14,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:41:14,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:14,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:14,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:41:14,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:41:14,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-05 22:41:14,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:41:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923036541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:41:14,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:41:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213025520] [2025-02-05 22:41:14,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:14,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:41:14,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:41:14,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:41:14,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:41:14,500 INFO L87 Difference]: Start difference. First operand has 95 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-02-05 22:41:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:14,536 INFO L93 Difference]: Finished difference Result 182 states and 317 transitions. [2025-02-05 22:41:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:41:14,539 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 195 [2025-02-05 22:41:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:14,546 INFO L225 Difference]: With dead ends: 182 [2025-02-05 22:41:14,546 INFO L226 Difference]: Without dead ends: 90 [2025-02-05 22:41:14,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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-02-05 22:41:14,555 INFO L435 NwaCegarLoop]: 138 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, 138 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-02-05 22:41:14,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:41:14,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-05 22:41:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-05 22:41:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 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-02-05 22:41:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2025-02-05 22:41:14,604 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 195 [2025-02-05 22:41:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:14,605 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2025-02-05 22:41:14,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-02-05 22:41:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2025-02-05 22:41:14,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:41:14,608 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:14,609 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] [2025-02-05 22:41:14,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 22:41:14,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:41:14,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:14,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1219022219, now seen corresponding path program 1 times [2025-02-05 22:41:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:14,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651244723] [2025-02-05 22:41:14,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:14,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:41:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:41:14,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:14,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:15,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:41:15,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:41:15,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651244723] [2025-02-05 22:41:15,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651244723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:15,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:41:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863226457] [2025-02-05 22:41:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:15,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:41:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:41:15,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:41:15,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:41:15,346 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-05 22:41:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:15,603 INFO L93 Difference]: Finished difference Result 266 states and 410 transitions. [2025-02-05 22:41:15,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:41:15,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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 195 [2025-02-05 22:41:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:15,608 INFO L225 Difference]: With dead ends: 266 [2025-02-05 22:41:15,609 INFO L226 Difference]: Without dead ends: 179 [2025-02-05 22:41:15,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:41:15,612 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 85 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:41:15,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 384 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:41:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-05 22:41:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 146. [2025-02-05 22:41:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 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-02-05 22:41:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2025-02-05 22:41:15,652 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 195 [2025-02-05 22:41:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:15,653 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2025-02-05 22:41:15,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-02-05 22:41:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2025-02-05 22:41:15,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 22:41:15,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:15,661 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-02-05 22:41:15,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:41:15,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:15,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:15,662 INFO L85 PathProgramCache]: Analyzing trace with hash -904076044, now seen corresponding path program 1 times [2025-02-05 22:41:15,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:15,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621359490] [2025-02-05 22:41:15,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:15,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 22:41:15,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 22:41:15,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:15,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:41:16,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:41:16,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621359490] [2025-02-05 22:41:16,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621359490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:16,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:16,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:41:16,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947864624] [2025-02-05 22:41:16,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:16,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:41:16,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:41:16,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:41:16,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:41:16,137 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-02-05 22:41:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:16,386 INFO L93 Difference]: Finished difference Result 342 states and 513 transitions. [2025-02-05 22:41:16,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:41:16,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-02-05 22:41:16,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:16,390 INFO L225 Difference]: With dead ends: 342 [2025-02-05 22:41:16,393 INFO L226 Difference]: Without dead ends: 255 [2025-02-05 22:41:16,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-02-05 22:41:16,394 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 137 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:41:16,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 357 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:41:16,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-02-05 22:41:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 214. [2025-02-05 22:41:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 135 states have (on average 1.2592592592592593) internal successors, (170), 136 states have internal predecessors, (170), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 22:41:16,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 318 transitions. [2025-02-05 22:41:16,455 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 318 transitions. Word has length 196 [2025-02-05 22:41:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:16,456 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 318 transitions. [2025-02-05 22:41:16,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 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-02-05 22:41:16,456 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 318 transitions. [2025-02-05 22:41:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 22:41:16,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:16,461 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-02-05 22:41:16,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:41:16,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:16,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:16,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1414610221, now seen corresponding path program 1 times [2025-02-05 22:41:16,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:16,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753500541] [2025-02-05 22:41:16,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:16,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 22:41:16,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 22:41:16,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:16,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:16,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:41:16,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:41:16,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753500541] [2025-02-05 22:41:16,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753500541] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:16,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:16,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:41:16,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525427813] [2025-02-05 22:41:16,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:16,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 22:41:16,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:41:16,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 22:41:16,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:41:16,602 INFO L87 Difference]: Start difference. First operand 214 states and 318 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) 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-02-05 22:41:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:16,709 INFO L93 Difference]: Finished difference Result 441 states and 657 transitions. [2025-02-05 22:41:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 22:41:16,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) 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-02-05 22:41:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:16,718 INFO L225 Difference]: With dead ends: 441 [2025-02-05 22:41:16,719 INFO L226 Difference]: Without dead ends: 290 [2025-02-05 22:41:16,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 22:41:16,721 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 121 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:41:16,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 258 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:41:16,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-02-05 22:41:16,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2025-02-05 22:41:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 176 states have (on average 1.2045454545454546) internal successors, (212), 177 states have internal predecessors, (212), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-02-05 22:41:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 420 transitions. [2025-02-05 22:41:16,788 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 420 transitions. Word has length 196 [2025-02-05 22:41:16,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:16,789 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 420 transitions. [2025-02-05 22:41:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) 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-02-05 22:41:16,790 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 420 transitions. [2025-02-05 22:41:16,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 22:41:16,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41: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, 1] [2025-02-05 22:41:16,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:41:16,793 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:16,794 INFO L85 PathProgramCache]: Analyzing trace with hash 538719121, now seen corresponding path program 1 times [2025-02-05 22:41:16,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:16,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871590396] [2025-02-05 22:41:16,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:16,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:16,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:41:16,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:41:16,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:16,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:17,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:41:17,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:41:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871590396] [2025-02-05 22:41:17,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871590396] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:41:17,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071871727] [2025-02-05 22:41:17,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:17,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:41:17,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:41:17,159 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:41:17,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 22:41:17,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:41:17,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:41:17,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:17,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:17,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-05 22:41:17,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:41:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 22:41:17,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:41:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:41:18,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071871727] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:41:18,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:41:18,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2025-02-05 22:41:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534289760] [2025-02-05 22:41:18,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:41:18,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-05 22:41:18,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:41:18,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-05 22:41:18,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-05 22:41:18,329 INFO L87 Difference]: Start difference. First operand 287 states and 420 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-05 22:41:20,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:20,138 INFO L93 Difference]: Finished difference Result 691 states and 967 transitions. [2025-02-05 22:41:20,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-05 22:41:20,139 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 197 [2025-02-05 22:41:20,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:20,143 INFO L225 Difference]: With dead ends: 691 [2025-02-05 22:41:20,143 INFO L226 Difference]: Without dead ends: 459 [2025-02-05 22:41:20,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=661, Invalid=2309, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 22:41:20,146 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 981 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:41:20,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 681 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:41:20,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-02-05 22:41:20,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 327. [2025-02-05 22:41:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 196 states have (on average 1.1020408163265305) internal successors, (216), 197 states have internal predecessors, (216), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 22:41:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 440 transitions. [2025-02-05 22:41:20,198 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 440 transitions. Word has length 197 [2025-02-05 22:41:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:20,198 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 440 transitions. [2025-02-05 22:41:20,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 19 states have internal predecessors, (149), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2025-02-05 22:41:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 440 transitions. [2025-02-05 22:41:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 22:41:20,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:20,201 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-02-05 22:41:20,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:41:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:41:20,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 680973777, now seen corresponding path program 1 times [2025-02-05 22:41:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:41:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450508760] [2025-02-05 22:41:20,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:41:20,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:41:20,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:41:20,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:20,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:41:20,482 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 22:41:20,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 22:41:20,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 22:41:20,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:20,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 22:41:20,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 22:41:20,674 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 22:41:20,675 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 22:41:20,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:41:20,679 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-02-05 22:41:20,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 22:41:20,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:41:20 BoogieIcfgContainer [2025-02-05 22:41:20,851 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 22:41:20,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 22:41:20,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 22:41:20,851 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 22:41:20,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:41:13" (3/4) ... [2025-02-05 22:41:20,854 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 22:41:20,854 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 22:41:20,856 INFO L158 Benchmark]: Toolchain (without parser) took 8099.24ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 106.4MB in the beginning and 214.7MB in the end (delta: -108.3MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2025-02-05 22:41:20,857 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:41:20,857 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.00ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 91.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 22:41:20,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.86ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:41:20,858 INFO L158 Benchmark]: Boogie Preprocessor took 46.63ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 22:41:20,858 INFO L158 Benchmark]: IcfgBuilder took 460.38ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 63.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 22:41:20,858 INFO L158 Benchmark]: TraceAbstraction took 7207.56ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 63.0MB in the beginning and 214.8MB in the end (delta: -151.8MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. [2025-02-05 22:41:20,858 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 285.2MB. Free memory was 214.8MB in the beginning and 214.7MB in the end (delta: 83.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 22:41:20,860 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.26ms. Allocated memory is still 201.3MB. Free memory is still 126.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.00ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 91.0MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.86ms. Allocated memory is still 142.6MB. Free memory was 91.0MB in the beginning and 88.1MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.63ms. Allocated memory is still 142.6MB. Free memory was 88.1MB in the beginning and 86.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 460.38ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 63.0MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 7207.56ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 63.0MB in the beginning and 214.8MB in the end (delta: -151.8MB). Peak memory consumption was 113.9MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 285.2MB. Free memory was 214.8MB in the beginning and 214.7MB in the end (delta: 83.1kB). 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 68, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 172, overapproximation of someBinaryFLOATComparisonOperation at line 156, overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someUnaryDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 197, overapproximation of someBinaryDOUBLEComparisonOperation at line 131, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 211, overapproximation of someBinaryDOUBLEComparisonOperation at line 195. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_32 = 0; [L44] signed short int var_1_33 = 10; [L45] signed long int var_1_34 = -10; [L46] double var_1_36 = 4.85; [L47] double var_1_37 = 2.5; [L48] double var_1_38 = 15.75; [L49] signed char var_1_39 = -100; [L50] signed char var_1_40 = 1; [L51] signed short int var_1_41 = -32; [L52] signed char var_1_42 = 4; [L53] signed char var_1_43 = -8; [L54] signed short int var_1_44 = -25; [L55] signed char last_1_var_1_10 = -5; [L56] signed long int last_1_var_1_21 = 1; [L57] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L215] isInitial = 1 [L216] FCALL initially() [L217] COND TRUE 1 [L218] CALL updateLastVariables() [L206] last_1_var_1_10 = var_1_10 [L207] last_1_var_1_21 = var_1_21 [L208] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L218] RET updateLastVariables() [L219] CALL updateVariables() [L155] var_1_3 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L157] var_1_4 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L158] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L159] var_1_7 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L160] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L162] var_1_8 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L163] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L164] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L164] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=256] [L165] var_1_9 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L166] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L167] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L167] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L168] var_1_11 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L169] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L170] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L170] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L171] var_1_13 = __VERIFIER_nondet_float() [L172] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L172] 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L173] var_1_14 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L174] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L175] var_1_15 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_15 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L176] RET assume_abort_if_not((var_1_15 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L177] var_1_16 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_16 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L178] RET assume_abort_if_not((var_1_16 >= 0.0F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L179] var_1_20 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L180] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L181] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L181] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L182] var_1_22 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L183] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L184] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L184] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L185] var_1_23 = __VERIFIER_nondet_short() [L186] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L186] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L187] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L187] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L188] var_1_32 = __VERIFIER_nondet_short() [L189] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L189] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L190] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L190] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L191] var_1_33 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L193] CALL assume_abort_if_not(var_1_33 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L193] RET assume_abort_if_not(var_1_33 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L194] var_1_37 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L195] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L196] var_1_38 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L197] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L198] var_1_40 = __VERIFIER_nondet_char() [L199] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L199] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L200] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L200] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L201] var_1_43 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L202] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L203] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L203] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L219] RET updateVariables() [L220] CALL step() [L61] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L62] COND TRUE var_1_11 <= last_1_var_1_25 [L63] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L66] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L67] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L68] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L72] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L73] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L80] COND FALSE !(\read(var_1_19)) [L83] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L85] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L86] COND TRUE var_1_19 || stepLocal_0 [L87] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L91] signed long int stepLocal_3 = var_1_22 + var_1_11; [L92] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L93] COND FALSE !(\read(var_1_20)) [L106] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L108] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L109] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L112] COND FALSE !(var_1_17 >= 25) [L123] var_1_26 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L127] var_1_34 = ((((128) < (((((var_1_1) > ((-5 + var_1_17))) ? (var_1_1) : ((-5 + var_1_17)))))) ? (128) : (((((var_1_1) > ((-5 + var_1_17))) ? (var_1_1) : ((-5 + var_1_17))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L128] COND FALSE !(\read(var_1_19)) [L131] var_1_36 = ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L133] var_1_39 = var_1_40 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L134] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L137] COND FALSE !(var_1_33 <= var_1_10) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=1, var_1_9=3] [L140] COND TRUE (! var_1_19) || var_1_19 [L141] var_1_44 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=0, var_1_8=1, var_1_9=3] [L220] RET step() [L221] CALL, EXPR property() [L211-L212] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=0, var_1_8=1, var_1_9=3] [L221] RET, EXPR property() [L221] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=0, var_1_8=1, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000006, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=3, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000005, var_1_37=10000000005, var_1_38=10000000005, var_1_39=126, var_1_40=126, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-5, var_1_7=0, var_1_8=1, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1342 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1324 mSDsluCounter, 1818 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 715 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1186 IncrementalHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 715 mSolverCounterUnsat, 677 mSDtfsCounter, 1186 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 651 GetRequests, 592 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=327occurred in iteration=5, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 209 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1569 NumberOfCodeBlocks, 1569 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1560 ConstructedInterpolants, 0 QuantifiedInterpolants, 3271 SizeOfPredicates, 7 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 4 PerfectInterpolantSequences, 13778/13920 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-02-05 22:41:20,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:41:23,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:41:23,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 22:41:23,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:41:23,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:41:23,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:41:23,180 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:41:23,180 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:41:23,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:41:23,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:41:23,181 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:41:23,181 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:41:23,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:41:23,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:41:23,182 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 22:41:23,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:41:23,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:41:23,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:41:23,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:41:23,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:41:23,184 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-jdk21/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 -> 704e29e6339fd63b233612798d0cc532362d3cecfd08254fd11a83f7be7afb70 [2025-02-05 22:41:23,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:41:23,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:41:23,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:41:23,497 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:41:23,497 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:41:23,498 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:24,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35158efc6/1e6c972623294164a3e426d8a22cb3fa/FLAG9a7dd4bec [2025-02-05 22:41:25,120 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:41:25,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:25,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35158efc6/1e6c972623294164a3e426d8a22cb3fa/FLAG9a7dd4bec [2025-02-05 22:41:25,413 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/35158efc6/1e6c972623294164a3e426d8a22cb3fa [2025-02-05 22:41:25,415 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:41:25,416 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:41:25,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:41:25,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:41:25,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:41:25,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34618d89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25, skipping insertion in model container [2025-02-05 22:41:25,422 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:41:25,554 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2025-02-05 22:41:25,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:41:25,628 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:41:25,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i[919,932] [2025-02-05 22:41:25,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:41:25,688 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:41:25,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25 WrapperNode [2025-02-05 22:41:25,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:41:25,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:41:25,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:41:25,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:41:25,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,727 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 212 [2025-02-05 22:41:25,727 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:41:25,728 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:41:25,728 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:41:25,728 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:41:25,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,757 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-02-05 22:41:25,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,758 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,767 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,771 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:41:25,775 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:41:25,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:41:25,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:41:25,776 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (1/1) ... [2025-02-05 22:41:25,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:41:25,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:41:25,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 22:41:25,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 22:41:25,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:41:25,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 22:41:25,834 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:41:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:41:25,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:41:25,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:41:25,916 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:41:25,917 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:41:32,533 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-02-05 22:41:32,533 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:41:32,545 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:41:32,546 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:41:32,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:41:32 BoogieIcfgContainer [2025-02-05 22:41:32,546 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:41:32,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:41:32,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:41:32,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:41:32,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:41:25" (1/3) ... [2025-02-05 22:41:32,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0cc641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:41:32, skipping insertion in model container [2025-02-05 22:41:32,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:41:25" (2/3) ... [2025-02-05 22:41:32,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0cc641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:41:32, skipping insertion in model container [2025-02-05 22:41:32,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:41:32" (3/3) ... [2025-02-05 22:41:32,554 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i [2025-02-05 22:41:32,565 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:41:32,567 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-15.i that has 2 procedures, 95 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:41:32,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:41:32,631 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;@1a7f2175, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:41:32,632 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:41:32,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 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-02-05 22:41:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:41:32,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:32,649 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] [2025-02-05 22:41:32,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:32,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:32,656 INFO L85 PathProgramCache]: Analyzing trace with hash 164409113, now seen corresponding path program 1 times [2025-02-05 22:41:32,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:41:32,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408802268] [2025-02-05 22:41:32,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:32,668 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-02-05 22:41:32,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:41:32,672 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-05 22:41:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:41:32,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:41:33,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:41:33,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:33,338 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:41:33,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:41:33,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2025-02-05 22:41:33,406 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:41:33,406 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:41:33,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408802268] [2025-02-05 22:41:33,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408802268] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:33,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 22:41:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615054150] [2025-02-05 22:41:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:41:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:41:33,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:41:33,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:41:33,436 INFO L87 Difference]: Start difference. First operand has 95 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 63 states have internal predecessors, (88), 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.0) internal successors, (52), 2 states have internal predecessors, (52), 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-02-05 22:41:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:33,469 INFO L93 Difference]: Finished difference Result 182 states and 317 transitions. [2025-02-05 22:41:33,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:41:33,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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 195 [2025-02-05 22:41:33,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:33,479 INFO L225 Difference]: With dead ends: 182 [2025-02-05 22:41:33,480 INFO L226 Difference]: Without dead ends: 90 [2025-02-05 22:41:33,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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-02-05 22:41:33,489 INFO L435 NwaCegarLoop]: 138 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, 138 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-02-05 22:41:33,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:41:33,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-05 22:41:33,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-05 22:41:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 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-02-05 22:41:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 138 transitions. [2025-02-05 22:41:33,535 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 138 transitions. Word has length 195 [2025-02-05 22:41:33,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:33,536 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 138 transitions. [2025-02-05 22:41:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 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-02-05 22:41:33,536 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 138 transitions. [2025-02-05 22:41:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-05 22:41:33,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:33,540 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] [2025-02-05 22:41:33,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:41:33,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-05 22:41:33,742 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1219022219, now seen corresponding path program 1 times [2025-02-05 22:41:33,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:41:33,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482936622] [2025-02-05 22:41:33,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:33,744 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-02-05 22:41:33,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:41:33,746 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-05 22:41:33,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:41:33,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-05 22:41:34,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-05 22:41:34,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:34,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:34,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 22:41:34,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:41:37,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:41:37,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:41:37,558 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:41:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482936622] [2025-02-05 22:41:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482936622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:41:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447553653] [2025-02-05 22:41:37,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:37,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:41:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:41:37,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:41:37,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:41:37,566 INFO L87 Difference]: Start difference. First operand 90 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 22:41:39,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:41:41,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:41:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:41:41,787 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2025-02-05 22:41:41,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:41:41,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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 195 [2025-02-05 22:41:41,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:41:41,810 INFO L225 Difference]: With dead ends: 265 [2025-02-05 22:41:41,811 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 22:41:41,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:41:41,812 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 79 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:41:41,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 386 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-02-05 22:41:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 22:41:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 146. [2025-02-05 22:41:41,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 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-02-05 22:41:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2025-02-05 22:41:41,854 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 195 [2025-02-05 22:41:41,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:41:41,854 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2025-02-05 22:41:41,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 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-02-05 22:41:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2025-02-05 22:41:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 22:41:41,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:41:41,857 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-02-05 22:41:41,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:41:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-05 22:41:42,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:41:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:41:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash -904076044, now seen corresponding path program 1 times [2025-02-05 22:41:42,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:41:42,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488438566] [2025-02-05 22:41:42,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:41:42,060 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-02-05 22:41:42,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:41:42,062 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-05 22:41:42,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-05 22:41:42,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 22:41:42,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 22:41:42,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:41:42,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:41:42,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 22:41:42,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:41:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-05 22:41:44,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:41:44,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:41:44,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488438566] [2025-02-05 22:41:44,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488438566] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:41:44,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:41:44,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 22:41:44,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308535564] [2025-02-05 22:41:44,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:41:44,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:41:44,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:41:44,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:41:44,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:41:44,583 INFO L87 Difference]: Start difference. First operand 146 states and 223 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-02-05 22:41:46,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:41:51,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:41:53,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:41:56,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:42:06,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:42:08,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-05 22:42:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:42:08,807 INFO L93 Difference]: Finished difference Result 320 states and 493 transitions. [2025-02-05 22:42:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:42:08,822 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-02-05 22:42:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:42:08,825 INFO L225 Difference]: With dead ends: 320 [2025-02-05 22:42:08,825 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 22:42:08,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:42:08,827 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 123 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2025-02-05 22:42:08,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 356 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 23.4s Time] [2025-02-05 22:42:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 22:42:08,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 148. [2025-02-05 22:42:08,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 85 states have (on average 1.2352941176470589) internal successors, (105), 85 states have internal predecessors, (105), 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-02-05 22:42:08,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2025-02-05 22:42:08,877 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 196 [2025-02-05 22:42:08,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:42:08,878 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2025-02-05 22:42:08,879 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-02-05 22:42:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2025-02-05 22:42:08,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-05 22:42:08,881 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:42:08,881 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-02-05 22:42:08,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-05 22:42:09,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-05 22:42:09,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:42:09,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:42:09,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1748547915, now seen corresponding path program 1 times [2025-02-05 22:42:09,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:42:09,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227827250] [2025-02-05 22:42:09,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:09,083 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-02-05 22:42:09,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:42:09,090 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-05 22:42:09,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-05 22:42:09,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-05 22:42:09,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-05 22:42:09,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:09,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:09,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:42:09,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:42:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-02-05 22:42:11,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:42:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:42:12,078 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:42:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227827250] [2025-02-05 22:42:12,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227827250] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:42:12,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:42:12,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-02-05 22:42:12,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246780204] [2025-02-05 22:42:12,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:42:12,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 22:42:12,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:42:12,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 22:42:12,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-05 22:42:12,080 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 22:42:14,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:17,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:19,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:20,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:42:20,264 INFO L93 Difference]: Finished difference Result 340 states and 509 transitions. [2025-02-05 22:42:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 22:42:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 196 [2025-02-05 22:42:20,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:42:20,283 INFO L225 Difference]: With dead ends: 340 [2025-02-05 22:42:20,283 INFO L226 Difference]: Without dead ends: 251 [2025-02-05 22:42:20,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-02-05 22:42:20,285 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 477 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:42:20,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 423 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2025-02-05 22:42:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-02-05 22:42:20,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 154. [2025-02-05 22:42:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:42:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 228 transitions. [2025-02-05 22:42:20,328 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 228 transitions. Word has length 196 [2025-02-05 22:42:20,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:42:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 228 transitions. [2025-02-05 22:42:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2025-02-05 22:42:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 228 transitions. [2025-02-05 22:42:20,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 22:42:20,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:42:20,332 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] [2025-02-05 22:42:20,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-02-05 22:42:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-05 22:42:20,533 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:42:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:42:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1911216819, now seen corresponding path program 1 times [2025-02-05 22:42:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:42:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649337042] [2025-02-05 22:42:20,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:20,534 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-02-05 22:42:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:42:20,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-05 22:42:20,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-05 22:42:20,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 22:42:20,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 22:42:20,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:20,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:21,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:42:21,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:42:21,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-02-05 22:42:21,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:42:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:42:22,202 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:42:22,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649337042] [2025-02-05 22:42:22,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649337042] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:42:22,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:42:22,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-02-05 22:42:22,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857821802] [2025-02-05 22:42:22,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:42:22,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:42:22,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:42:22,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:42:22,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:42:22,204 INFO L87 Difference]: Start difference. First operand 154 states and 228 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 22:42:25,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:42:26,031 INFO L93 Difference]: Finished difference Result 258 states and 373 transitions. [2025-02-05 22:42:26,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:42:26,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 197 [2025-02-05 22:42:26,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:42:26,058 INFO L225 Difference]: With dead ends: 258 [2025-02-05 22:42:26,058 INFO L226 Difference]: Without dead ends: 167 [2025-02-05 22:42:26,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 385 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:42:26,062 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 162 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-05 22:42:26,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 212 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-05 22:42:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-05 22:42:26,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2025-02-05 22:42:26,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.0869565217391304) internal successors, (100), 92 states have internal predecessors, (100), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:42:26,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 220 transitions. [2025-02-05 22:42:26,108 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 220 transitions. Word has length 197 [2025-02-05 22:42:26,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:42:26,108 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 220 transitions. [2025-02-05 22:42:26,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 22:42:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 220 transitions. [2025-02-05 22:42:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:42:26,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:42:26,111 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-02-05 22:42:26,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-05 22:42:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-02-05 22:42:26,312 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:42:26,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:42:26,313 INFO L85 PathProgramCache]: Analyzing trace with hash -525082382, now seen corresponding path program 1 times [2025-02-05 22:42:26,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:42:26,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836916941] [2025-02-05 22:42:26,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:26,313 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-02-05 22:42:26,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:42:26,315 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-02-05 22:42:26,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-05 22:42:26,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:42:26,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:42:26,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:26,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:26,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 22:42:26,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:42:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2025-02-05 22:42:27,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:42:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-05 22:42:27,708 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:42:27,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836916941] [2025-02-05 22:42:27,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836916941] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:42:27,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:42:27,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-02-05 22:42:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629175819] [2025-02-05 22:42:27,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:42:27,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:42:27,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:42:27,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:42:27,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 22:42:27,710 INFO L87 Difference]: Start difference. First operand 159 states and 220 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 22:42:29,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:42:29,942 INFO L93 Difference]: Finished difference Result 259 states and 354 transitions. [2025-02-05 22:42:29,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-05 22:42:29,963 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 199 [2025-02-05 22:42:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:42:29,966 INFO L225 Difference]: With dead ends: 259 [2025-02-05 22:42:29,966 INFO L226 Difference]: Without dead ends: 167 [2025-02-05 22:42:29,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-02-05 22:42:29,969 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 155 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:42:29,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 213 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-02-05 22:42:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-05 22:42:29,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 159. [2025-02-05 22:42:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 92 states have (on average 1.076086956521739) internal successors, (99), 92 states have internal predecessors, (99), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-05 22:42:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 219 transitions. [2025-02-05 22:42:29,996 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 219 transitions. Word has length 199 [2025-02-05 22:42:29,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:42:29,997 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 219 transitions. [2025-02-05 22:42:29,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2025-02-05 22:42:29,997 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 219 transitions. [2025-02-05 22:42:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:42:30,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:42:30,010 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-02-05 22:42:30,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-02-05 22:42:30,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-02-05 22:42:30,211 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:42:30,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:42:30,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1035616559, now seen corresponding path program 1 times [2025-02-05 22:42:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:42:30,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666570865] [2025-02-05 22:42:30,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:30,212 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-02-05 22:42:30,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:42:30,214 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-05 22:42:30,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-02-05 22:42:30,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:42:30,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:42:30,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:30,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:30,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:42:30,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:42:31,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 22:42:31,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:42:32,045 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 22:42:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666570865] [2025-02-05 22:42:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666570865] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:42:32,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2009977367] [2025-02-05 22:42:32,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-05 22:42:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-05 22:42:32,048 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-05 22:42:32,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2025-02-05 22:42:32,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:42:33,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:42:33,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:33,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:33,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 22:42:33,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:42:34,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-02-05 22:42:34,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:42:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2009977367] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:42:34,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 22:42:34,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2025-02-05 22:42:34,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643056180] [2025-02-05 22:42:34,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 22:42:34,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 22:42:34,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 22:42:34,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 22:42:34,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:42:34,161 INFO L87 Difference]: Start difference. First operand 159 states and 219 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:42:37,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-05 22:42:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:42:37,511 INFO L93 Difference]: Finished difference Result 373 states and 491 transitions. [2025-02-05 22:42:37,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:42:37,529 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 199 [2025-02-05 22:42:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:42:37,531 INFO L225 Difference]: With dead ends: 373 [2025-02-05 22:42:37,532 INFO L226 Difference]: Without dead ends: 281 [2025-02-05 22:42:37,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2025-02-05 22:42:37,534 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 243 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:42:37,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 648 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 22:42:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-05 22:42:37,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 246. [2025-02-05 22:42:37,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 151 states have (on average 1.0794701986754967) internal successors, (163), 152 states have internal predecessors, (163), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 22:42:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2025-02-05 22:42:37,565 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 199 [2025-02-05 22:42:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:42:37,566 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2025-02-05 22:42:37,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 22:42:37,566 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2025-02-05 22:42:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 22:42:37,567 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:42:37,567 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-02-05 22:42:37,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2025-02-05 22:42:37,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2025-02-05 22:42:37,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-02-05 22:42:37,968 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:42:37,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:42:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1006987408, now seen corresponding path program 1 times [2025-02-05 22:42:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 22:42:37,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195228592] [2025-02-05 22:42:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:42:37,970 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-02-05 22:42:37,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-05 22:42:37,971 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-02-05 22:42:37,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-05 22:42:38,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 22:42:38,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 22:42:38,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:42:38,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:42:38,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 22:42:38,253 INFO L279 TraceCheckSpWp]: Computing forward predicates...