./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.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_loopvsstraightlinecode_100-while_file-72.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 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:03:31,990 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:03:32,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:03:32,049 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:03:32,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:03:32,071 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:03:32,072 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:03:32,072 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:03:32,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:03:32,072 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:03:32,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:03:32,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:03:32,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:03:32,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:03:32,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:03:32,075 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:03:32,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:32,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:03:32,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:03:32,076 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 -> 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 [2025-02-06 01:03:32,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:03:32,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:03:32,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:03:32,322 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:03:32,322 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:03:32,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:03:33,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75575c72d/350565c88fbf44c6b8a78565146a8f75/FLAG04b4e84ab [2025-02-06 01:03:33,702 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:03:33,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:03:33,710 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75575c72d/350565c88fbf44c6b8a78565146a8f75/FLAG04b4e84ab [2025-02-06 01:03:33,730 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/75575c72d/350565c88fbf44c6b8a78565146a8f75 [2025-02-06 01:03:33,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:03:33,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:03:33,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:33,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:03:33,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:03:33,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:33" (1/1) ... [2025-02-06 01:03:33,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49603888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:33, skipping insertion in model container [2025-02-06 01:03:33,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:33" (1/1) ... [2025-02-06 01:03:33,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:03:33,874 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_loopvsstraightlinecode_100-while_file-72.i[916,929] [2025-02-06 01:03:33,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:33,974 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:03:33,982 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_loopvsstraightlinecode_100-while_file-72.i[916,929] [2025-02-06 01:03:34,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:34,034 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:03:34,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34 WrapperNode [2025-02-06 01:03:34,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:34,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:34,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:03:34,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:03:34,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,072 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 301 [2025-02-06 01:03:34,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:34,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:03:34,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:03:34,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:03:34,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,099 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-06 01:03:34,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,109 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:03:34,126 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:03:34,127 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:03:34,127 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:03:34,127 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (1/1) ... [2025-02-06 01:03:34,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:34,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:34,154 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-06 01:03:34,157 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-06 01:03:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:03:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:03:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:03:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:03:34,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:03:34,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:03:34,234 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:03:34,236 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:03:34,620 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L200: havoc property_#t~ite25#1;havoc property_#t~bitwise23#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1;havoc property_#t~ite28#1;havoc property_#t~bitwise27#1;havoc property_#t~short29#1;havoc property_#t~ite31#1;havoc property_#t~bitwise30#1;havoc property_#t~short32#1; [2025-02-06 01:03:34,650 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-02-06 01:03:34,650 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:03:34,674 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:03:34,674 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:03:34,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:03:34 BoogieIcfgContainer [2025-02-06 01:03:34,675 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:03:34,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:03:34,678 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:03:34,681 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:03:34,682 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:03:33" (1/3) ... [2025-02-06 01:03:34,682 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a5e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:03:34, skipping insertion in model container [2025-02-06 01:03:34,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:34" (2/3) ... [2025-02-06 01:03:34,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185a5e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:03:34, skipping insertion in model container [2025-02-06 01:03:34,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:03:34" (3/3) ... [2025-02-06 01:03:34,685 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:03:34,711 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:03:34,715 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-72.i that has 2 procedures, 124 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:03:34,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:03:34,773 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;@648f9eb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:03:34,773 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:03:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 01:03:34,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:34,789 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:34,790 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:34,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:34,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:34,794 INFO L85 PathProgramCache]: Analyzing trace with hash -351138815, now seen corresponding path program 1 times [2025-02-06 01:03:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787996184] [2025-02-06 01:03:34,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:34,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:34,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:34,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:34,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:34,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-06 01:03:35,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:35,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787996184] [2025-02-06 01:03:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787996184] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:03:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757311049] [2025-02-06 01:03:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:35,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:35,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:35,096 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-06 01:03:35,098 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-06 01:03:35,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:35,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:35,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:35,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:35,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:03:35,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:03:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 1568 trivial. 0 not checked. [2025-02-06 01:03:35,258 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:03:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757311049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:03:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:03:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456292441] [2025-02-06 01:03:35,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:35,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:03:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:35,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:03:35,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:03:35,288 INFO L87 Difference]: Start difference. First operand has 124 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 93 states have internal predecessors, (135), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 01:03:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:35,326 INFO L93 Difference]: Finished difference Result 238 states and 404 transitions. [2025-02-06 01:03:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:03:35,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 194 [2025-02-06 01:03:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:35,333 INFO L225 Difference]: With dead ends: 238 [2025-02-06 01:03:35,334 INFO L226 Difference]: Without dead ends: 117 [2025-02-06 01:03:35,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:03:35,340 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:35,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:03:35,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-02-06 01:03:35,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2025-02-06 01:03:35,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 86 states have internal predecessors, (122), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 01:03:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2025-02-06 01:03:35,376 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 194 [2025-02-06 01:03:35,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:35,377 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2025-02-06 01:03:35,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 01:03:35,377 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2025-02-06 01:03:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:35,382 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:35,382 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:35,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:03:35,582 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-06 01:03:35,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:35,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:35,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1525682434, now seen corresponding path program 1 times [2025-02-06 01:03:35,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:35,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526135743] [2025-02-06 01:03:35,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:35,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:35,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:35,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:35,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:35,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:03:35,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:35,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526135743] [2025-02-06 01:03:35,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526135743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:35,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:35,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:03:35,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124442513] [2025-02-06 01:03:35,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:35,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:03:35,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:35,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:03:35,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:03:35,997 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:36,257 INFO L93 Difference]: Finished difference Result 346 states and 535 transitions. [2025-02-06 01:03:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:03:36,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-02-06 01:03:36,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:36,260 INFO L225 Difference]: With dead ends: 346 [2025-02-06 01:03:36,260 INFO L226 Difference]: Without dead ends: 232 [2025-02-06 01:03:36,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:36,263 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 129 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:36,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 577 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:03:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-02-06 01:03:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 185. [2025-02-06 01:03:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 124 states have (on average 1.3790322580645162) internal successors, (171), 124 states have internal predecessors, (171), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 01:03:36,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 287 transitions. [2025-02-06 01:03:36,300 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 287 transitions. Word has length 194 [2025-02-06 01:03:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 287 transitions. [2025-02-06 01:03:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 287 transitions. [2025-02-06 01:03:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:36,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:36,307 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:36,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:03:36,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:36,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1116858209, now seen corresponding path program 1 times [2025-02-06 01:03:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:36,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372292515] [2025-02-06 01:03:36,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:36,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:36,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:36,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:36,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:36,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:03:36,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:36,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372292515] [2025-02-06 01:03:36,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372292515] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:03:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914082136] [2025-02-06 01:03:36,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:36,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:03:36,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:36,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:03:36,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:03:36,593 INFO L87 Difference]: Start difference. First operand 185 states and 287 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:36,675 INFO L93 Difference]: Finished difference Result 430 states and 665 transitions. [2025-02-06 01:03:36,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:03:36,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-02-06 01:03:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:36,680 INFO L225 Difference]: With dead ends: 430 [2025-02-06 01:03:36,680 INFO L226 Difference]: Without dead ends: 310 [2025-02-06 01:03:36,681 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:03:36,682 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 169 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:36,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 415 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:03:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-02-06 01:03:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2025-02-06 01:03:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 216 states have (on average 1.3935185185185186) internal successors, (301), 216 states have internal predecessors, (301), 87 states have call successors, (87), 3 states have call predecessors, (87), 3 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-06 01:03:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 475 transitions. [2025-02-06 01:03:36,731 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 475 transitions. Word has length 194 [2025-02-06 01:03:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 475 transitions. [2025-02-06 01:03:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 475 transitions. [2025-02-06 01:03:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:36,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:36,736 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:36,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:03:36,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:36,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1049851456, now seen corresponding path program 1 times [2025-02-06 01:03:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032111313] [2025-02-06 01:03:36,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:36,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:36,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:36,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:36,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:03:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032111313] [2025-02-06 01:03:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032111313] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:03:37,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562819668] [2025-02-06 01:03:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:37,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:03:37,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:37,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:03:37,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:03:37,326 INFO L87 Difference]: Start difference. First operand 307 states and 475 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:37,650 INFO L93 Difference]: Finished difference Result 723 states and 1108 transitions. [2025-02-06 01:03:37,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:03:37,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-02-06 01:03:37,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:37,655 INFO L225 Difference]: With dead ends: 723 [2025-02-06 01:03:37,655 INFO L226 Difference]: Without dead ends: 498 [2025-02-06 01:03:37,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:37,659 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 309 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:37,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 807 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:03:37,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-02-06 01:03:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 467. [2025-02-06 01:03:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 338 states have (on average 1.3816568047337279) internal successors, (467), 340 states have internal predecessors, (467), 122 states have call successors, (122), 6 states have call predecessors, (122), 6 states have return successors, (122), 120 states have call predecessors, (122), 122 states have call successors, (122) [2025-02-06 01:03:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 711 transitions. [2025-02-06 01:03:37,718 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 711 transitions. Word has length 194 [2025-02-06 01:03:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:37,718 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 711 transitions. [2025-02-06 01:03:37,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 711 transitions. [2025-02-06 01:03:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:37,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:37,721 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:37,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:03:37,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:37,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1178934175, now seen corresponding path program 1 times [2025-02-06 01:03:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:37,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606177664] [2025-02-06 01:03:37,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:37,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:37,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:37,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:37,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:37,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:38,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:03:38,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:38,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606177664] [2025-02-06 01:03:38,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606177664] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:38,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:38,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:03:38,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341952619] [2025-02-06 01:03:38,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:38,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:03:38,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:38,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:03:38,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:03:38,774 INFO L87 Difference]: Start difference. First operand 467 states and 711 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:39,116 INFO L93 Difference]: Finished difference Result 1233 states and 1841 transitions. [2025-02-06 01:03:39,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:03:39,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-02-06 01:03:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:39,122 INFO L225 Difference]: With dead ends: 1233 [2025-02-06 01:03:39,122 INFO L226 Difference]: Without dead ends: 850 [2025-02-06 01:03:39,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:39,124 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 246 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:39,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 724 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:03:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-02-06 01:03:39,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 742. [2025-02-06 01:03:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 601 states have (on average 1.4126455906821964) internal successors, (849), 607 states have internal predecessors, (849), 130 states have call successors, (130), 10 states have call predecessors, (130), 10 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2025-02-06 01:03:39,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1109 transitions. [2025-02-06 01:03:39,167 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1109 transitions. Word has length 194 [2025-02-06 01:03:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:39,167 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1109 transitions. [2025-02-06 01:03:39,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:39,167 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1109 transitions. [2025-02-06 01:03:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:03:39,169 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:39,169 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:39,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:03:39,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1209953982, now seen corresponding path program 1 times [2025-02-06 01:03:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:39,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608169875] [2025-02-06 01:03:39,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:39,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:39,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:03:39,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:03:39,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:39,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:03:40,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:40,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608169875] [2025-02-06 01:03:40,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608169875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:03:40,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:03:40,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 01:03:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899825221] [2025-02-06 01:03:40,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:03:40,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:03:40,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:40,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:03:40,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:40,215 INFO L87 Difference]: Start difference. First operand 742 states and 1109 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:40,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:40,473 INFO L93 Difference]: Finished difference Result 1466 states and 2159 transitions. [2025-02-06 01:03:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:03:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2025-02-06 01:03:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:40,478 INFO L225 Difference]: With dead ends: 1466 [2025-02-06 01:03:40,478 INFO L226 Difference]: Without dead ends: 832 [2025-02-06 01:03:40,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:03:40,480 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 335 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:40,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 741 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:03:40,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-02-06 01:03:40,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 708. [2025-02-06 01:03:40,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 549 states have (on average 1.378870673952641) internal successors, (757), 557 states have internal predecessors, (757), 142 states have call successors, (142), 16 states have call predecessors, (142), 16 states have return successors, (142), 134 states have call predecessors, (142), 142 states have call successors, (142) [2025-02-06 01:03:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1041 transitions. [2025-02-06 01:03:40,554 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1041 transitions. Word has length 194 [2025-02-06 01:03:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:40,554 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 1041 transitions. [2025-02-06 01:03:40,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:03:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1041 transitions. [2025-02-06 01:03:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:03:40,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:40,556 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:40,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:03:40,556 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:40,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:40,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1447991773, now seen corresponding path program 1 times [2025-02-06 01:03:40,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:40,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286574889] [2025-02-06 01:03:40,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:40,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:40,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:40,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:40,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:40,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-06 01:03:40,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:40,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286574889] [2025-02-06 01:03:40,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286574889] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:03:40,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902077857] [2025-02-06 01:03:40,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:40,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:40,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:40,732 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-06 01:03:40,734 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-06 01:03:40,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:40,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:40,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:40,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:40,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:03:40,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:03:41,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2025-02-06 01:03:41,102 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:03:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-06 01:03:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902077857] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:03:41,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:03:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 01:03:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048789669] [2025-02-06 01:03:41,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:03:41,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:03:41,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:41,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:03:41,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:41,324 INFO L87 Difference]: Start difference. First operand 708 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 01:03:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:41,539 INFO L93 Difference]: Finished difference Result 1213 states and 1751 transitions. [2025-02-06 01:03:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:03:41,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 196 [2025-02-06 01:03:41,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:41,545 INFO L225 Difference]: With dead ends: 1213 [2025-02-06 01:03:41,545 INFO L226 Difference]: Without dead ends: 587 [2025-02-06 01:03:41,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:03:41,546 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 103 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:41,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 350 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:03:41,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2025-02-06 01:03:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 549. [2025-02-06 01:03:41,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 395 states have (on average 1.3164556962025316) internal successors, (520), 399 states have internal predecessors, (520), 134 states have call successors, (134), 19 states have call predecessors, (134), 19 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 01:03:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 788 transitions. [2025-02-06 01:03:41,586 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 788 transitions. Word has length 196 [2025-02-06 01:03:41,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:41,589 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 788 transitions. [2025-02-06 01:03:41,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 01:03:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 788 transitions. [2025-02-06 01:03:41,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:03:41,590 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:41,590 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:41,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 01:03:41,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:41,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:41,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1193255228, now seen corresponding path program 1 times [2025-02-06 01:03:41,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:41,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961242445] [2025-02-06 01:03:41,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:41,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:41,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:41,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:41,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:41,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:03:41,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692889717] [2025-02-06 01:03:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:41,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:41,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:03:41,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 01:03:41,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:41,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:41,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:41,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:41,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 01:03:41,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:03:42,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 891 proven. 144 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2025-02-06 01:03:42,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:03:47,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:03:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961242445] [2025-02-06 01:03:47,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 01:03:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692889717] [2025-02-06 01:03:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692889717] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:03:47,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:03:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-02-06 01:03:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63350593] [2025-02-06 01:03:47,413 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-06 01:03:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 01:03:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:03:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 01:03:47,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=397, Unknown=1, NotChecked=0, Total=506 [2025-02-06 01:03:47,414 INFO L87 Difference]: Start difference. First operand 549 states and 788 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 14 states have internal predecessors, (69), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-02-06 01:03:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:49,262 INFO L93 Difference]: Finished difference Result 1815 states and 2497 transitions. [2025-02-06 01:03:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-02-06 01:03:49,262 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 14 states have internal predecessors, (69), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 196 [2025-02-06 01:03:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:49,269 INFO L225 Difference]: With dead ends: 1815 [2025-02-06 01:03:49,269 INFO L226 Difference]: Without dead ends: 1362 [2025-02-06 01:03:49,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=736, Invalid=2343, Unknown=1, NotChecked=0, Total=3080 [2025-02-06 01:03:49,271 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 371 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:49,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1270 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 01:03:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2025-02-06 01:03:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 808. [2025-02-06 01:03:49,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 638 states have (on average 1.3307210031347962) internal successors, (849), 642 states have internal predecessors, (849), 134 states have call successors, (134), 35 states have call predecessors, (134), 35 states have return successors, (134), 130 states have call predecessors, (134), 134 states have call successors, (134) [2025-02-06 01:03:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1117 transitions. [2025-02-06 01:03:49,342 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1117 transitions. Word has length 196 [2025-02-06 01:03:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:49,342 INFO L471 AbstractCegarLoop]: Abstraction has 808 states and 1117 transitions. [2025-02-06 01:03:49,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 14 states have internal predecessors, (69), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2025-02-06 01:03:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1117 transitions. [2025-02-06 01:03:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:03:49,344 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:49,344 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:03:49,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:03:49,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:49,549 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1886356925, now seen corresponding path program 1 times [2025-02-06 01:03:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:03:49,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490732715] [2025-02-06 01:03:49,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:03:49,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:49,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:49,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:49,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:03:49,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [488151620] [2025-02-06 01:03:49,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:49,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:03:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:49,612 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:03:49,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 01:03:49,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:49,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:49,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:49,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:03:49,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:03:49,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:03:49,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:03:49,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:49,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:03:49,838 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:03:49,839 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:03:49,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:03:49,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 01:03:50,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-02-06 01:03:50,045 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:03:50,172 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:03:50,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:03:50 BoogieIcfgContainer [2025-02-06 01:03:50,176 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:03:50,177 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:03:50,177 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:03:50,177 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:03:50,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:03:34" (3/4) ... [2025-02-06 01:03:50,180 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:03:50,180 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:03:50,181 INFO L158 Benchmark]: Toolchain (without parser) took 16446.07ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 109.5MB in the beginning and 232.7MB in the end (delta: -123.2MB). Peak memory consumption was 104.0MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,181 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 125.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:03:50,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.93ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 92.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.85ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,182 INFO L158 Benchmark]: Boogie Preprocessor took 52.95ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 78.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,182 INFO L158 Benchmark]: IcfgBuilder took 548.09ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 39.9MB in the end (delta: 38.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,182 INFO L158 Benchmark]: TraceAbstraction took 15498.89ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 39.9MB in the beginning and 232.8MB in the end (delta: -192.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2025-02-06 01:03:50,183 INFO L158 Benchmark]: Witness Printer took 3.34ms. Allocated memory is still 369.1MB. Free memory was 232.8MB in the beginning and 232.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:03:50,184 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.23ms. Allocated memory is still 201.3MB. Free memory was 125.9MB in the beginning and 125.6MB in the end (delta: 307.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.93ms. Allocated memory is still 142.6MB. Free memory was 108.5MB in the beginning and 92.4MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.85ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 87.2MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.95ms. Allocated memory is still 142.6MB. Free memory was 87.2MB in the beginning and 78.4MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 548.09ms. Allocated memory is still 142.6MB. Free memory was 78.4MB in the beginning and 39.9MB in the end (delta: 38.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15498.89ms. Allocated memory was 142.6MB in the beginning and 369.1MB in the end (delta: 226.5MB). Free memory was 39.9MB in the beginning and 232.8MB in the end (delta: -192.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 3.34ms. Allocated memory is still 369.1MB. Free memory was 232.8MB in the beginning and 232.7MB in the end (delta: 75.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 164, overapproximation of someBinaryFLOATComparisonOperation at line 200, overapproximation of someBinaryDOUBLEComparisonOperation at line 109, overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryDOUBLEComparisonOperation at line 161, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 162, overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryDOUBLEComparisonOperation at line 106, overapproximation of someBinaryDOUBLEComparisonOperation at line 159, overapproximation of someBinaryDOUBLEComparisonOperation at line 115, overapproximation of someBinaryDOUBLEComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed short int var_1_8 = -16; [L28] signed long int var_1_12 = -10; [L29] double var_1_14 = 127.8; [L30] double var_1_15 = 1.375; [L31] unsigned char var_1_19 = 1; [L32] float var_1_20 = 10.4; [L33] float var_1_21 = 3.075; [L34] double var_1_22 = 64.375; [L35] signed char var_1_23 = 16; [L36] signed char var_1_24 = 64; [L37] signed char var_1_25 = 0; [L38] double var_1_26 = 255.125; [L39] unsigned short int var_1_27 = 128; [L40] unsigned char var_1_28 = 1; [L41] unsigned short int var_1_29 = 128; [L42] unsigned short int var_1_30 = 49567; [L43] unsigned short int var_1_31 = 100; [L44] unsigned short int var_1_32 = 0; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 4; [L47] unsigned short int var_1_35 = 0; [L48] unsigned long int var_1_36 = 16; [L49] signed short int last_1_var_1_8 = -16; [L50] signed long int last_1_var_1_12 = -10; [L51] float last_1_var_1_20 = 10.4; [L52] signed char last_1_var_1_23 = 16; [L53] unsigned char last_1_var_1_28 = 1; [L54] unsigned short int last_1_var_1_29 = 128; [L55] unsigned long int last_1_var_1_36 = 16; VAL [isInitial=0, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L204] isInitial = 1 [L205] FCALL initially() [L206] COND TRUE 1 [L207] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_12 = var_1_12 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_23 = var_1_23 [L195] last_1_var_1_28 = var_1_28 [L196] last_1_var_1_29 = var_1_29 [L197] last_1_var_1_36 = var_1_36 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L207] RET updateLastVariables() [L208] CALL updateVariables() [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L148] var_1_5 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L149] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L151] var_1_6 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L152] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L153] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L153] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L155] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L156] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L156] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] 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_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L158] 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_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L160] var_1_15 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L161] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L163] var_1_21 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L164] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L165] var_1_24 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_24 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L166] RET assume_abort_if_not(var_1_24 >= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L168] var_1_25 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L171] var_1_30 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L172] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L174] var_1_31 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L177] var_1_32 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L178] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L180] var_1_33 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L181] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L183] var_1_34 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L184] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L186] var_1_35 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L187] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] CALL assume_abort_if_not(var_1_35 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] RET assume_abort_if_not(var_1_35 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L208] RET updateVariables() [L209] CALL step() [L59] signed long int stepLocal_7 = last_1_var_1_23 + var_1_24; [L60] signed long int stepLocal_6 = last_1_var_1_23; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L61] COND FALSE !(\read(var_1_7)) [L70] var_1_28 = 0 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L72] unsigned char stepLocal_5 = var_1_21 != last_1_var_1_20; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_5=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L73] COND FALSE !((var_1_6 || last_1_var_1_28) && stepLocal_5) [L76] var_1_23 = (var_1_25 - var_1_24) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L78] COND FALSE !(\read(var_1_5)) [L81] var_1_26 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L83] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L84] COND FALSE !(\read(var_1_28)) [L87] var_1_8 = var_1_23 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L89] unsigned char stepLocal_3 = var_1_27 < (var_1_23 >> 25); [L90] unsigned short int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_3=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] COND FALSE !(stepLocal_3 && var_1_6) [L98] var_1_19 = var_1_7 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] signed long int stepLocal_4 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_4=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L101] COND FALSE !(last_1_var_1_23 <= stepLocal_4) [L104] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L106] COND TRUE var_1_20 > var_1_15 [L107] var_1_22 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L109] COND TRUE var_1_20 < var_1_14 [L110] var_1_29 = ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] EXPR (var_1_23 * var_1_23) & var_1_8 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] signed long int stepLocal_1 = (var_1_23 * var_1_23) & var_1_8; [L115] COND TRUE (var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L116] COND TRUE var_1_14 >= (var_1_15 * var_1_22) [L117] var_1_12 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L128] unsigned char stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L129] COND FALSE !(stepLocal_0 || var_1_19) [L132] var_1_1 = (var_1_4 && ((var_1_5 || var_1_6) || var_1_7)) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L134] COND TRUE (var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36) [L135] var_1_36 = var_1_30 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L209] RET step() [L210] CALL, EXPR property() [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200-L201] return ((((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0)))) && ((var_1_20 < var_1_14) ? (var_1_29 == ((unsigned short int) ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))))) : (var_1_29 == ((unsigned short int) ((((var_1_24) > ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35))) ? (var_1_24) : ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35)))))))) && (((var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36)) ? (var_1_36 == ((unsigned long int) var_1_30)) : ((((var_1_28 || var_1_19) || var_1_7) && var_1_1) ? (var_1_36 == ((unsigned long int) var_1_31)) : (var_1_36 == ((unsigned long int) var_1_34)))) ; [L210] RET, EXPR property() [L210] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 124 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.3s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1679 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1662 mSDsluCounter, 5058 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3428 mSDsCounter, 264 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2207 IncrementalHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 264 mSolverCounterUnsat, 1630 mSDtfsCounter, 2207 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 970 GetRequests, 884 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=808occurred in iteration=8, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 905 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2534 NumberOfCodeBlocks, 2534 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2131 ConstructedInterpolants, 10 QuantifiedInterpolants, 5571 SizeOfPredicates, 5 NumberOfNonLiveVariables, 1401 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 6 PerfectInterpolantSequences, 17439/17864 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-06 01:03:50,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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_loopvsstraightlinecode_100-while_file-72.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 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:03:51,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:03:52,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:03:52,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:03:52,080 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:03:52,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:03:52,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:03:52,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:03:52,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:03:52,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:03:52,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:03:52,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:03:52,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:03:52,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:03:52,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:52,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:03:52,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:03:52,110 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 -> 6b261b46738dc0a9db26822637ec843da493e234cf769a01c10942fcb0315b00 [2025-02-06 01:03:52,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:03:52,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:03:52,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:03:52,341 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:03:52,342 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:03:52,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:03:53,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9995e6b71/6c72c98133284b288ac78050e2a978dc/FLAG22da28bda [2025-02-06 01:03:53,697 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:03:53,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:03:53,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9995e6b71/6c72c98133284b288ac78050e2a978dc/FLAG22da28bda [2025-02-06 01:03:54,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9995e6b71/6c72c98133284b288ac78050e2a978dc [2025-02-06 01:03:54,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:03:54,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:03:54,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:54,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:03:54,054 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:03:54,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63ee1ed5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54, skipping insertion in model container [2025-02-06 01:03:54,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:03:54,160 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_loopvsstraightlinecode_100-while_file-72.i[916,929] [2025-02-06 01:03:54,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:54,232 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:03:54,239 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_loopvsstraightlinecode_100-while_file-72.i[916,929] [2025-02-06 01:03:54,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:03:54,281 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:03:54,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54 WrapperNode [2025-02-06 01:03:54,282 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:03:54,283 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:54,283 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:03:54,283 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:03:54,288 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,320 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-02-06 01:03:54,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:03:54,321 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:03:54,323 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:03:54,323 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:03:54,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,358 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-06 01:03:54,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,370 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:03:54,375 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:03:54,375 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:03:54,375 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:03:54,376 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (1/1) ... [2025-02-06 01:03:54,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:03:54,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:03:54,405 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-06 01:03:54,415 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-06 01:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:03:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:03:54,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:03:54,504 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:03:54,505 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:04:12,684 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 01:04:12,684 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:04:12,691 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:04:12,692 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:04:12,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:04:12 BoogieIcfgContainer [2025-02-06 01:04:12,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:04:12,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:04:12,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:04:12,699 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:04:12,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:03:54" (1/3) ... [2025-02-06 01:04:12,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102eb08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:04:12, skipping insertion in model container [2025-02-06 01:04:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:03:54" (2/3) ... [2025-02-06 01:04:12,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@102eb08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:04:12, skipping insertion in model container [2025-02-06 01:04:12,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:04:12" (3/3) ... [2025-02-06 01:04:12,702 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-72.i [2025-02-06 01:04:12,712 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:04:12,714 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-72.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:04:12,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:04:12,777 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;@74a7ecfe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:04:12,777 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:04:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 01:04:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 01:04:12,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:04:12,790 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:04:12,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:04:12,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:04:12,794 INFO L85 PathProgramCache]: Analyzing trace with hash -295687051, now seen corresponding path program 1 times [2025-02-06 01:04:12,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:04:12,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246568420] [2025-02-06 01:04:12,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:04:12,802 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-06 01:04:12,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:04:12,804 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-06 01:04:12,805 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-06 01:04:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 01:04:13,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 01:04:13,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:04:13,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:04:13,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:04:13,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:04:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 644 proven. 0 refuted. 0 times theorem prover too weak. 980 trivial. 0 not checked. [2025-02-06 01:04:13,975 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:04:13,975 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:04:13,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246568420] [2025-02-06 01:04:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246568420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:04:13,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:04:13,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:04:13,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139507141] [2025-02-06 01:04:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:04:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:04:13,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:04:13,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:04:13,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:04:13,999 INFO L87 Difference]: Start difference. First operand has 85 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 54 states have internal predecessors, (74), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 01:04:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:04:14,017 INFO L93 Difference]: Finished difference Result 164 states and 288 transitions. [2025-02-06 01:04:14,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:04:14,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2025-02-06 01:04:14,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:04:14,024 INFO L225 Difference]: With dead ends: 164 [2025-02-06 01:04:14,024 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 01:04:14,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-06 01:04:14,029 INFO L435 NwaCegarLoop]: 127 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, 127 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-06 01:04:14,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:04:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 01:04:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 01:04:14,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 01:04:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2025-02-06 01:04:14,058 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 127 transitions. Word has length 187 [2025-02-06 01:04:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:04:14,058 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 127 transitions. [2025-02-06 01:04:14,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2025-02-06 01:04:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 127 transitions. [2025-02-06 01:04:14,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 01:04:14,065 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:04:14,065 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:04:14,094 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-06 01:04:14,265 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-06 01:04:14,266 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:04:14,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:04:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1589859988, now seen corresponding path program 1 times [2025-02-06 01:04:14,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:04:14,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259481399] [2025-02-06 01:04:14,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:04:14,267 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-06 01:04:14,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:04:14,271 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-06 01:04:14,272 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-06 01:04:14,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 01:04:15,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 01:04:15,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:04:15,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:04:15,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:04:15,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:04:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2025-02-06 01:04:20,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:04:23,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2025-02-06 01:04:23,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:04:23,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259481399] [2025-02-06 01:04:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259481399] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:04:23,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:04:23,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-06 01:04:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644943766] [2025-02-06 01:04:23,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:04:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:04:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:04:23,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:04:23,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:04:23,752 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 01:04:31,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:04:35,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:04:39,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:04:39,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:04:39,070 INFO L93 Difference]: Finished difference Result 169 states and 258 transitions. [2025-02-06 01:04:39,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:04:39,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 187 [2025-02-06 01:04:39,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:04:39,198 INFO L225 Difference]: With dead ends: 169 [2025-02-06 01:04:39,198 INFO L226 Difference]: Without dead ends: 90 [2025-02-06 01:04:39,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 366 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:04:39,200 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2025-02-06 01:04:39,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 214 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 157 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2025-02-06 01:04:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-06 01:04:39,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2025-02-06 01:04:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-02-06 01:04:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 129 transitions. [2025-02-06 01:04:39,223 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 129 transitions. Word has length 187 [2025-02-06 01:04:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:04:39,223 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 129 transitions. [2025-02-06 01:04:39,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2025-02-06 01:04:39,224 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 129 transitions. [2025-02-06 01:04:39,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 01:04:39,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:04:39,225 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:04:39,255 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-06 01:04:39,425 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-06 01:04:39,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:04:39,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:04:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 745388117, now seen corresponding path program 1 times [2025-02-06 01:04:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:04:39,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348409900] [2025-02-06 01:04:39,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:04:39,431 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-06 01:04:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:04:39,433 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-06 01:04:39,434 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-06 01:04:39,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 01:04:40,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 01:04:40,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:04:40,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:04:40,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 01:04:40,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:04:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:04:40,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:04:40,684 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:04:40,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348409900] [2025-02-06 01:04:40,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348409900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:04:40,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:04:40,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:04:40,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941811430] [2025-02-06 01:04:40,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:04:40,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:04:40,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:04:40,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:04:40,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:04:40,686 INFO L87 Difference]: Start difference. First operand 86 states and 129 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:04:45,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:04:49,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:04:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:04:49,884 INFO L93 Difference]: Finished difference Result 252 states and 381 transitions. [2025-02-06 01:04:49,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:04:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2025-02-06 01:04:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:04:49,887 INFO L225 Difference]: With dead ends: 252 [2025-02-06 01:04:49,887 INFO L226 Difference]: Without dead ends: 169 [2025-02-06 01:04:49,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:04:49,888 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 115 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:04:49,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 320 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 2 Unknown, 0 Unchecked, 9.2s Time] [2025-02-06 01:04:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-02-06 01:04:49,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2025-02-06 01:04:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 103 states have (on average 1.3106796116504855) internal successors, (135), 103 states have internal predecessors, (135), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-06 01:04:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2025-02-06 01:04:49,915 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 187 [2025-02-06 01:04:49,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:04:49,915 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2025-02-06 01:04:49,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:04:49,916 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2025-02-06 01:04:49,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-02-06 01:04:49,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:04:49,919 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 01:04:49,948 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 (4)] Forceful destruction successful, exit code 0 [2025-02-06 01:04:50,119 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-06 01:04:50,119 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:04:50,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:04:50,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2098697814, now seen corresponding path program 1 times [2025-02-06 01:04:50,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:04:50,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703397013] [2025-02-06 01:04:50,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:04:50,120 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-06 01:04:50,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:04:50,123 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-06 01:04:50,123 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-06 01:04:50,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-02-06 01:04:51,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-02-06 01:04:51,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:04:51,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:04:51,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:04:51,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:05:02,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2025-02-06 01:05:02,795 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:05:02,795 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:05:02,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703397013] [2025-02-06 01:05:02,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703397013] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:02,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:02,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:05:02,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214907313] [2025-02-06 01:05:02,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:02,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:05:02,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:05:02,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:05:02,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:05:02,796 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2025-02-06 01:05:07,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []