./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-62.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-62.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 1dd8a7215fe4b2d5955a290f14103073a7e9062c9800650ba65c716d3de779da --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:02:05,712 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:02:05,770 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:02:05,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:02:05,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:02:05,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:02:05,794 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:02:05,794 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:02:05,794 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:02:05,795 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:02:05,795 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:02:05,795 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:02:05,796 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:02:05,796 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:02:05,796 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:02:05,796 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:02:05,797 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:02:05,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:02:05,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:02:05,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:02:05,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:02:05,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:02:05,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:02:05,799 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:02:05,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:02:05,799 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 -> 1dd8a7215fe4b2d5955a290f14103073a7e9062c9800650ba65c716d3de779da [2025-02-06 01:02:06,034 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:02:06,042 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:02:06,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:02:06,044 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:02:06,044 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:02:06,045 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-62.i [2025-02-06 01:02:07,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67aa5c6c1/b6e0da0664a247248532a9ea424fedf0/FLAG00b5d0f73 [2025-02-06 01:02:07,467 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:02:07,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-62.i [2025-02-06 01:02:07,476 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67aa5c6c1/b6e0da0664a247248532a9ea424fedf0/FLAG00b5d0f73 [2025-02-06 01:02:07,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/67aa5c6c1/b6e0da0664a247248532a9ea424fedf0 [2025-02-06 01:02:07,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:02:07,716 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:02:07,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:02:07,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:02:07,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:02:07,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:07,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4ae29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07, skipping insertion in model container [2025-02-06 01:02:07,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:07,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:02:07,835 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-62.i[916,929] [2025-02-06 01:02:07,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:02:07,893 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:02:07,904 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-62.i[916,929] [2025-02-06 01:02:07,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:02:07,963 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:02:07,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07 WrapperNode [2025-02-06 01:02:07,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:02:07,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:02:07,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:02:07,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:02:07,969 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:02:07" (1/1) ... [2025-02-06 01:02:07,977 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:02:07" (1/1) ... [2025-02-06 01:02:08,002 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 207 [2025-02-06 01:02:08,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:02:08,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:02:08,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:02:08,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:02:08,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,036 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:02:08,036 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,036 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,047 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,048 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,053 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:02:08,060 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:02:08,060 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:02:08,060 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:02:08,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (1/1) ... [2025-02-06 01:02:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:02:08,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:08,095 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:02:08,098 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:02:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:02:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:02:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:02:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:02:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:02:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:02:08,196 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:02:08,198 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:02:08,598 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-06 01:02:08,598 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:02:08,607 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:02:08,608 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:02:08,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:08 BoogieIcfgContainer [2025-02-06 01:02:08,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:02:08,610 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:02:08,610 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:02:08,614 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:02:08,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:02:07" (1/3) ... [2025-02-06 01:02:08,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4000a559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:08, skipping insertion in model container [2025-02-06 01:02:08,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:07" (2/3) ... [2025-02-06 01:02:08,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4000a559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:08, skipping insertion in model container [2025-02-06 01:02:08,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:08" (3/3) ... [2025-02-06 01:02:08,616 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-62.i [2025-02-06 01:02:08,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:02:08,629 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:02:08,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:02:08,681 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;@3cfee602, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:02:08,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:02:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:02:08,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:02:08,695 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:08,696 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:08,696 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1401716029, now seen corresponding path program 1 times [2025-02-06 01:02:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:08,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250683662] [2025-02-06 01:02:08,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:08,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:08,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-06 01:02:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250683662] [2025-02-06 01:02:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250683662] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:02:09,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920847041] [2025-02-06 01:02:09,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:09,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:09,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:09,006 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:02:09,007 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:02:09,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:09,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:09,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:09,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:09,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:02:09,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:02:09,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-02-06 01:02:09,185 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:02:09,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920847041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:02:09,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:02:09,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:02:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585288142] [2025-02-06 01:02:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:02:09,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:02:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:09,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:02:09,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:02:09,218 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 01:02:09,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:09,234 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2025-02-06 01:02:09,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:02:09,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-02-06 01:02:09,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:09,239 INFO L225 Difference]: With dead ends: 174 [2025-02-06 01:02:09,239 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 01:02:09,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 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:02:09,243 INFO L435 NwaCegarLoop]: 135 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, 135 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:02:09,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:02:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 01:02:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 01:02:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:02:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-02-06 01:02:09,272 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-02-06 01:02:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-02-06 01:02:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 01:02:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-02-06 01:02:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:02:09,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:09,275 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:09,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:02:09,479 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:02:09,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:09,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1835758341, now seen corresponding path program 1 times [2025-02-06 01:02:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:09,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445645547] [2025-02-06 01:02:09,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:09,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:09,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:09,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:09,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:09,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-06 01:02:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:09,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445645547] [2025-02-06 01:02:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445645547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:02:09,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:02:09,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:02:09,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026084662] [2025-02-06 01:02:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:02:09,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:02:09,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:09,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:02:09,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:02:09,729 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-06 01:02:09,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:09,796 INFO L93 Difference]: Finished difference Result 207 states and 318 transitions. [2025-02-06 01:02:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:02:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-02-06 01:02:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:09,799 INFO L225 Difference]: With dead ends: 207 [2025-02-06 01:02:09,800 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 01:02:09,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:02:09,801 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 49 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:02:09,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 298 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:02:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 01:02:09,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-02-06 01:02:09,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 83 states have internal predecessors, (112), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-06 01:02:09,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 182 transitions. [2025-02-06 01:02:09,816 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 182 transitions. Word has length 191 [2025-02-06 01:02:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:09,816 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 182 transitions. [2025-02-06 01:02:09,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-06 01:02:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 182 transitions. [2025-02-06 01:02:09,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:02:09,818 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:09,819 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:09,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:02:09,819 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:09,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash -951657146, now seen corresponding path program 1 times [2025-02-06 01:02:09,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:09,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287882924] [2025-02-06 01:02:09,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:09,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:09,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:09,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:09,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:09,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:11,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-02-06 01:02:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287882924] [2025-02-06 01:02:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287882924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:02:11,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:02:11,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:02:11,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91917449] [2025-02-06 01:02:11,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:02:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:02:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:11,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:02:11,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:02:11,261 INFO L87 Difference]: Start difference. First operand 120 states and 182 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-06 01:02:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:11,682 INFO L93 Difference]: Finished difference Result 377 states and 583 transitions. [2025-02-06 01:02:11,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 01:02:11,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2025-02-06 01:02:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:11,686 INFO L225 Difference]: With dead ends: 377 [2025-02-06 01:02:11,688 INFO L226 Difference]: Without dead ends: 260 [2025-02-06 01:02:11,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:02:11,689 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 149 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:02:11,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 528 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:02:11,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-02-06 01:02:11,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 211. [2025-02-06 01:02:11,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 142 states have (on average 1.380281690140845) internal successors, (196), 143 states have internal predecessors, (196), 65 states have call successors, (65), 3 states have call predecessors, (65), 3 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-02-06 01:02:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2025-02-06 01:02:11,717 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 191 [2025-02-06 01:02:11,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:11,718 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2025-02-06 01:02:11,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-02-06 01:02:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2025-02-06 01:02:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 01:02:11,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:11,720 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:11,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:02:11,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:11,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:11,720 INFO L85 PathProgramCache]: Analyzing trace with hash 593013759, now seen corresponding path program 1 times [2025-02-06 01:02:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569457188] [2025-02-06 01:02:11,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:11,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:11,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:02:11,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:02:11,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:11,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:12,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:12,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569457188] [2025-02-06 01:02:12,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569457188] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:02:12,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799479777] [2025-02-06 01:02:12,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:12,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:12,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:12,014 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:02:12,015 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:02:12,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:02:12,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:02:12,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:12,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:12,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:02:12,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:02:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2025-02-06 01:02:12,458 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:02:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799479777] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:02:12,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:02:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 01:02:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331515748] [2025-02-06 01:02:12,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:02:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:02:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:12,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:02:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:02:12,692 INFO L87 Difference]: Start difference. First operand 211 states and 326 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:02:12,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:12,924 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2025-02-06 01:02:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:02:12,925 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 192 [2025-02-06 01:02:12,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:12,927 INFO L225 Difference]: With dead ends: 328 [2025-02-06 01:02:12,927 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 01:02:12,927 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:02:12,928 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:02:12,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 257 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:02:12,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 01:02:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2025-02-06 01:02:12,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 108 states have (on average 1.2685185185185186) internal successors, (137), 108 states have internal predecessors, (137), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 01:02:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 257 transitions. [2025-02-06 01:02:12,954 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 257 transitions. Word has length 192 [2025-02-06 01:02:12,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:12,954 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 257 transitions. [2025-02-06 01:02:12,955 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:02:12,955 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 257 transitions. [2025-02-06 01:02:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 01:02:12,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:12,956 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:12,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:02:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:13,161 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:13,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:13,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1478324960, now seen corresponding path program 1 times [2025-02-06 01:02:13,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:13,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965572873] [2025-02-06 01:02:13,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:13,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:13,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 01:02:13,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 01:02:13,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:13,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:13,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965572873] [2025-02-06 01:02:13,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965572873] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:02:13,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923208845] [2025-02-06 01:02:13,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:13,496 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:02:13,497 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:02:13,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 01:02:13,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 01:02:13,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:13,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:13,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:02:13,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:02:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-02-06 01:02:13,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:02:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:13,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923208845] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:02:13,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:02:13,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 01:02:13,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265084804] [2025-02-06 01:02:13,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:02:13,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:02:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:13,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:02:13,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:02:13,987 INFO L87 Difference]: Start difference. First operand 174 states and 257 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 01:02:14,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:14,152 INFO L93 Difference]: Finished difference Result 303 states and 435 transitions. [2025-02-06 01:02:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:02:14,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 193 [2025-02-06 01:02:14,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:14,155 INFO L225 Difference]: With dead ends: 303 [2025-02-06 01:02:14,155 INFO L226 Difference]: Without dead ends: 194 [2025-02-06 01:02:14,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 383 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:02:14,156 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 67 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:02:14,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 222 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:02:14,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-06 01:02:14,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 182. [2025-02-06 01:02:14,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 114 states have (on average 1.236842105263158) internal successors, (141), 114 states have internal predecessors, (141), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 01:02:14,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 261 transitions. [2025-02-06 01:02:14,183 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 261 transitions. Word has length 193 [2025-02-06 01:02:14,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:14,184 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 261 transitions. [2025-02-06 01:02:14,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 01:02:14,184 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2025-02-06 01:02:14,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:02:14,185 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:14,186 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:14,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 01:02:14,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:14,387 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:14,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:14,387 INFO L85 PathProgramCache]: Analyzing trace with hash -350199105, now seen corresponding path program 1 times [2025-02-06 01:02:14,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:14,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300238614] [2025-02-06 01:02:14,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:14,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:14,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:02:14,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:02:14,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:14,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:14,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:02:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300238614] [2025-02-06 01:02:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300238614] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:02:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624478084] [2025-02-06 01:02:14,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:14,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:14,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:14,681 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:02:14,682 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:02:14,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:02:14,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:02:14,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:14,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:14,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-06 01:02:14,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:02:15,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 683 proven. 126 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-02-06 01:02:15,048 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:02:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:02:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624478084] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:02:15,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:02:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2025-02-06 01:02:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343454717] [2025-02-06 01:02:15,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:02:15,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 01:02:15,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:02:15,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 01:02:15,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:02:15,274 INFO L87 Difference]: Start difference. First operand 182 states and 261 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-02-06 01:02:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:15,577 INFO L93 Difference]: Finished difference Result 323 states and 447 transitions. [2025-02-06 01:02:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:02:15,578 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) Word has length 194 [2025-02-06 01:02:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:15,579 INFO L225 Difference]: With dead ends: 323 [2025-02-06 01:02:15,579 INFO L226 Difference]: Without dead ends: 210 [2025-02-06 01:02:15,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2025-02-06 01:02:15,581 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 108 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:02:15,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 507 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:02:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-02-06 01:02:15,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 198. [2025-02-06 01:02:15,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 60 states have call successors, (60), 11 states have call predecessors, (60), 11 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 01:02:15,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 269 transitions. [2025-02-06 01:02:15,611 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 269 transitions. Word has length 194 [2025-02-06 01:02:15,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:15,611 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 269 transitions. [2025-02-06 01:02:15,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 3 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (53), 3 states have call predecessors, (53), 3 states have call successors, (53) [2025-02-06 01:02:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 269 transitions. [2025-02-06 01:02:15,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 01:02:15,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:15,613 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:15,620 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:02:15,813 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,SelfDestructingSolverStorable5 [2025-02-06 01:02:15,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:15,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash 615277853, now seen corresponding path program 1 times [2025-02-06 01:02:15,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:02:15,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810307561] [2025-02-06 01:02:15,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:15,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:02:15,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:02:15,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:02:15,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:15,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:02:15,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609267338] [2025-02-06 01:02:15,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:15,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:15,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:15,956 INFO L229 MonitoredProcess]: Starting monitored process 6 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:02:15,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 01:02:16,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:02:16,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:02:16,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:16,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:02:16,572 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:02:16,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:02:16,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:02:16,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:16,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:02:16,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:02:16,743 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:02:16,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:02:16,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 01:02:16,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:02:16,948 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:17,033 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:02:17,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:02:17 BoogieIcfgContainer [2025-02-06 01:02:17,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:02:17,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:02:17,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:02:17,036 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:02:17,037 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:08" (3/4) ... [2025-02-06 01:02:17,038 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:02:17,038 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:02:17,039 INFO L158 Benchmark]: Toolchain (without parser) took 9322.73ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 105.3MB in the beginning and 293.4MB in the end (delta: -188.1MB). Peak memory consumption was 97.8MB. Max. memory is 16.1GB. [2025-02-06 01:02:17,039 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:02:17,039 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.44ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 88.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:02:17,039 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.83ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:02:17,040 INFO L158 Benchmark]: Boogie Preprocessor took 55.67ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 77.9MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:02:17,040 INFO L158 Benchmark]: IcfgBuilder took 548.30ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 50.4MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 01:02:17,040 INFO L158 Benchmark]: TraceAbstraction took 8425.49ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 49.6MB in the beginning and 293.5MB in the end (delta: -244.0MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. [2025-02-06 01:02:17,040 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 427.8MB. Free memory was 293.5MB in the beginning and 293.4MB in the end (delta: 110.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:02:17,041 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.44ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 88.0MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.83ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 84.0MB in the end (delta: 4.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.67ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 77.9MB in the end (delta: 6.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 548.30ms. Allocated memory is still 142.6MB. Free memory was 77.9MB in the beginning and 50.4MB in the end (delta: 27.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8425.49ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 49.6MB in the beginning and 293.5MB in the end (delta: -244.0MB). Peak memory consumption was 39.1MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 427.8MB. Free memory was 293.5MB in the beginning and 293.4MB in the end (delta: 110.8kB). 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 someBinaryArithmeticDOUBLEoperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 202, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 176, overapproximation of someUnaryDOUBLEoperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 116, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 202, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 151, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 110. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 32.2; [L23] double var_1_4 = 10000000.9; [L24] double var_1_5 = 32.46; [L25] double var_1_6 = 10000.6; [L26] unsigned long int var_1_7 = 128; [L27] unsigned long int var_1_9 = 1; [L28] unsigned long int var_1_10 = 10000; [L29] unsigned char var_1_12 = 0; [L30] unsigned char var_1_13 = 0; [L31] unsigned char var_1_14 = 1; [L32] unsigned char var_1_15 = 1; [L33] unsigned char var_1_16 = 0; [L34] double var_1_17 = 63.8; [L35] double var_1_18 = 64.125; [L36] double var_1_19 = 0.9; [L37] float var_1_20 = 8.8; [L38] float var_1_21 = 999999999999.75; [L39] float var_1_22 = 127.5; [L40] unsigned long int var_1_23 = 25; [L41] float var_1_24 = 127.75; [L42] float var_1_25 = 64.7; [L43] signed char var_1_26 = -128; [L44] signed char var_1_27 = 64; [L45] signed char var_1_28 = -16; [L46] signed char var_1_29 = -2; [L47] unsigned short int var_1_30 = 4; [L48] unsigned short int var_1_31 = 57679; [L49] unsigned short int var_1_32 = 23164; [L50] unsigned short int var_1_33 = 1; [L51] double last_1_var_1_1 = 32.2; [L52] unsigned long int last_1_var_1_7 = 128; [L53] unsigned long int last_1_var_1_9 = 1; [L54] unsigned short int last_1_var_1_30 = 4; VAL [isInitial=0, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L206] isInitial = 1 [L207] FCALL initially() [L208] COND TRUE 1 [L209] CALL updateLastVariables() [L196] last_1_var_1_1 = var_1_1 [L197] last_1_var_1_7 = var_1_7 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_4=100000009/10, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L209] RET updateLastVariables() [L210] CALL updateVariables() [L146] var_1_4 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L147] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_5=1623/50, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L148] var_1_5 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L149] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_6=50003/5, var_1_7=128, var_1_9=1] [L150] var_1_6 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L151] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=10000, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L152] var_1_10 = __VERIFIER_nondet_ulong() [L153] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L154] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L156] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L157] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L162] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L163] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L164] var_1_16 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L166] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_18=513/8, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L167] var_1_18 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L168] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_19=9/10, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L169] var_1_19 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L170] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=25, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L171] var_1_23 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L172] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L173] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] CALL assume_abort_if_not(var_1_23 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L174] RET assume_abort_if_not(var_1_23 != 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_24=511/4, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L175] var_1_24 = __VERIFIER_nondet_float() [L176] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L176] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_25=647/10, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L177] var_1_25 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L178] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=64, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L179] var_1_27 = __VERIFIER_nondet_char() [L180] CALL assume_abort_if_not(var_1_27 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L180] RET assume_abort_if_not(var_1_27 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L181] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-2, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L182] var_1_29 = __VERIFIER_nondet_char() [L183] CALL assume_abort_if_not(var_1_29 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L183] RET assume_abort_if_not(var_1_29 >= -127) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L184] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=57679, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L185] var_1_31 = __VERIFIER_nondet_ushort() [L186] CALL assume_abort_if_not(var_1_31 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L186] RET assume_abort_if_not(var_1_31 >= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L187] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=23164, var_1_33=1, var_1_7=128, var_1_9=1] [L188] var_1_32 = __VERIFIER_nondet_ushort() [L189] CALL assume_abort_if_not(var_1_32 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L189] RET assume_abort_if_not(var_1_32 >= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] CALL assume_abort_if_not(var_1_32 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L190] RET assume_abort_if_not(var_1_32 <= 32767) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=1, var_1_7=128, var_1_9=1] [L191] var_1_33 = __VERIFIER_nondet_ushort() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_7=128, var_1_9=1] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_7=128, var_1_9=1] [L193] CALL assume_abort_if_not(var_1_33 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=1] [L193] RET assume_abort_if_not(var_1_33 <= 16383) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=1] [L210] RET updateVariables() [L211] CALL step() [L58] var_1_9 = (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30))) [L59] unsigned char stepLocal_8 = var_1_14; [L60] unsigned char stepLocal_7 = var_1_14; [L61] unsigned short int stepLocal_6 = var_1_32; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_7=1, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L62] COND FALSE !(stepLocal_7 && var_1_16) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, stepLocal_8=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L65] COND TRUE (var_1_13 && (last_1_var_1_1 > 64.177)) || stepLocal_8 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_6=16383, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=4, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L66] COND TRUE var_1_10 >= stepLocal_6 [L67] var_1_30 = var_1_33 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L75] unsigned long int stepLocal_0 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_0=4, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=161/5, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L76] COND TRUE var_1_30 >= stepLocal_0 [L77] var_1_1 = ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=319/5, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L81] COND TRUE \read(var_1_13) [L82] var_1_17 = ((var_1_18 - var_1_19) + var_1_4) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L86] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_1=2, var_1_20=44/5, var_1_21=3999999999999/4, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_7=128, var_1_9=4] [L87] COND TRUE var_1_5 > var_1_18 [L88] var_1_21 = ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L93] signed long int stepLocal_4 = ~ var_1_30; [L94] unsigned short int stepLocal_3 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_4=-7, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=255/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L95] COND FALSE !((var_1_30 / var_1_23) == stepLocal_4) [L100] var_1_22 = 7.5f VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L102] unsigned short int stepLocal_5 = var_1_30; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L103] COND FALSE !(var_1_18 > var_1_24) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L110] COND TRUE var_1_4 <= (var_1_21 + (var_1_5 * var_1_6)) [L111] var_1_12 = ((var_1_13 && var_1_14) && var_1_15) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=44/5, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_6=0, var_1_7=128, var_1_9=4] [L115] COND TRUE (var_1_30 == var_1_30) || var_1_12 [L116] var_1_20 = ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L118] COND FALSE !(var_1_1 > (var_1_20 * (var_1_24 / 2.8))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L133] unsigned long int stepLocal_2 = var_1_9 - var_1_30; [L134] unsigned long int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_1=4, stepLocal_2=-2, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L135] COND TRUE 32 > stepLocal_1 VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_2=-2, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=128, var_1_9=4] [L136] COND TRUE (- var_1_30) != stepLocal_2 [L137] var_1_7 = ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, stepLocal_3=6, stepLocal_5=6, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L211] RET step() [L212] CALL, EXPR property() [L202-L203] return (((((((((((var_1_30 >= var_1_9) ? (var_1_1 == ((double) ((((((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) < 0 ) ? -(((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6) : (((((var_1_4) > (var_1_5)) ? (var_1_4) : (var_1_5))) + var_1_6))))) : (var_1_1 == ((double) (var_1_4 + var_1_5)))) && ((32 > var_1_9) ? (((- var_1_30) != (var_1_9 - var_1_30)) ? (var_1_7 == ((unsigned long int) ((((((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) < (var_1_30)) ? (((((5u) < (var_1_30)) ? (5u) : (var_1_30)))) : (var_1_30))))) : (var_1_7 == ((unsigned long int) var_1_9))) : (var_1_7 == ((unsigned long int) var_1_9)))) && (var_1_9 == ((unsigned long int) (((((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) < (last_1_var_1_30)) ? ((((((last_1_var_1_7) < (last_1_var_1_30)) ? (last_1_var_1_7) : (last_1_var_1_30))) + ((((last_1_var_1_30) < (last_1_var_1_30)) ? (last_1_var_1_30) : (last_1_var_1_30))))) : (last_1_var_1_30)))))) && ((var_1_4 <= (var_1_21 + (var_1_5 * var_1_6))) ? (var_1_12 == ((unsigned char) ((var_1_13 && var_1_14) && var_1_15))) : (var_1_12 == ((unsigned char) var_1_16)))) && (var_1_13 ? (var_1_17 == ((double) ((var_1_18 - var_1_19) + var_1_4))) : (var_1_17 == ((double) var_1_6)))) && (((var_1_30 == var_1_30) || var_1_12) ? (var_1_20 == ((float) ((((25.5f) < (var_1_4)) ? (25.5f) : (var_1_4))))) : 1)) && (var_1_13 ? ((var_1_5 > var_1_18) ? (var_1_21 == ((float) ((((var_1_18) < (var_1_6)) ? (var_1_18) : (var_1_6))))) : 1) : (var_1_21 == ((float) (var_1_5 + (1.55f + 5.7f)))))) && (((var_1_30 / var_1_23) == (~ var_1_30)) ? (((var_1_30 + (- var_1_30)) >= var_1_30) ? (var_1_22 == ((float) ((var_1_24 + var_1_25) + (var_1_18 - ((((31.85f) > (10.5f)) ? (31.85f) : (10.5f))))))) : 1) : (var_1_22 == ((float) 7.5f)))) && ((var_1_1 > (var_1_20 * (var_1_24 / 2.8))) ? (var_1_14 ? (var_1_13 ? (var_1_26 == ((signed char) ((((var_1_27) > (0)) ? (var_1_27) : (0))))) : (var_1_16 ? (var_1_26 == ((signed char) var_1_27)) : (var_1_26 == ((signed char) var_1_27)))) : (var_1_26 == ((signed char) var_1_27))) : 1)) && ((var_1_18 > var_1_24) ? ((var_1_23 <= var_1_30) ? (var_1_28 == ((signed char) ((((var_1_27) > (var_1_29)) ? (var_1_27) : (var_1_29))))) : (var_1_28 == ((signed char) var_1_29))) : 1)) && ((var_1_14 && var_1_16) ? (var_1_30 == ((unsigned short int) (var_1_31 - ((((var_1_32 - var_1_33) < 0 ) ? -(var_1_32 - var_1_33) : (var_1_32 - var_1_33)))))) : (((var_1_13 && (last_1_var_1_1 > 64.177)) || var_1_14) ? ((var_1_10 >= var_1_32) ? (var_1_30 == ((unsigned short int) var_1_33)) : ((! (last_1_var_1_9 >= var_1_27)) ? (var_1_30 == ((unsigned short int) var_1_33)) : 1)) : 1)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L212] RET, EXPR property() [L212] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=161/5, last_1_var_1_30=4, last_1_var_1_7=128, last_1_var_1_9=1, var_1_10=16383, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=1, var_1_16=0, var_1_18=3, var_1_1=2, var_1_20=51/2, var_1_21=3, var_1_22=15/2, var_1_23=2, var_1_26=-128, var_1_27=-127, var_1_28=-16, var_1_29=-127, var_1_30=6, var_1_31=-32769, var_1_32=16383, var_1_33=6, var_1_4=0, var_1_6=0, var_1_7=5, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 1947 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1191 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 921 IncrementalHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 756 mSDtfsCounter, 921 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1388 GetRequests, 1341 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 84 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 2312 NumberOfCodeBlocks, 2312 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2488 ConstructedInterpolants, 0 QuantifiedInterpolants, 7000 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1794 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 21935/22620 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:02:17,063 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-62.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 1dd8a7215fe4b2d5955a290f14103073a7e9062c9800650ba65c716d3de779da --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:02:19,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:02:19,185 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:02:19,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:02:19,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:02:19,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:02:19,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:02:19,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:02:19,221 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:02:19,222 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:02:19,222 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:02:19,222 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:02:19,222 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:02:19,223 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:02:19,223 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:02:19,223 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:02:19,223 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:02:19,223 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:02:19,223 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:02:19,224 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:02:19,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:02:19,225 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:02:19,225 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:02:19,225 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 -> 1dd8a7215fe4b2d5955a290f14103073a7e9062c9800650ba65c716d3de779da [2025-02-06 01:02:19,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:02:19,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:02:19,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:02:19,471 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:02:19,471 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:02:19,474 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-62.i [2025-02-06 01:02:20,755 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89fe72c58/fd585ff71bbf4435a38695526764b680/FLAGdf44795e5 [2025-02-06 01:02:20,972 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:02:20,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-62.i [2025-02-06 01:02:20,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89fe72c58/fd585ff71bbf4435a38695526764b680/FLAGdf44795e5 [2025-02-06 01:02:21,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/89fe72c58/fd585ff71bbf4435a38695526764b680 [2025-02-06 01:02:21,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:02:21,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:02:21,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:02:21,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:02:21,341 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:02:21,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,342 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53466432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21, skipping insertion in model container [2025-02-06 01:02:21,342 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,381 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:02:21,517 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-62.i[916,929] [2025-02-06 01:02:21,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:02:21,570 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:02:21,576 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-62.i[916,929] [2025-02-06 01:02:21,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:02:21,618 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:02:21,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21 WrapperNode [2025-02-06 01:02:21,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:02:21,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:02:21,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:02:21,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:02:21,627 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:02:21" (1/1) ... [2025-02-06 01:02:21,636 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:02:21" (1/1) ... [2025-02-06 01:02:21,657 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 205 [2025-02-06 01:02:21,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:02:21,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:02:21,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:02:21,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:02:21,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,669 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,679 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:02:21,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,686 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,687 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:02:21,691 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:02:21,691 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:02:21,691 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:02:21,692 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (1/1) ... [2025-02-06 01:02:21,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:02:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:02:21,713 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:02:21,714 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:02:21,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:02:21,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:02:21,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:02:21,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:02:21,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:02:21,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:02:21,786 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:02:21,787 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:02:53,288 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-02-06 01:02:53,288 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:02:53,296 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:02:53,296 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:02:53,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:53 BoogieIcfgContainer [2025-02-06 01:02:53,297 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:02:53,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:02:53,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:02:53,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:02:53,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:02:21" (1/3) ... [2025-02-06 01:02:53,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22dbd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:53, skipping insertion in model container [2025-02-06 01:02:53,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:02:21" (2/3) ... [2025-02-06 01:02:53,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22dbd00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:02:53, skipping insertion in model container [2025-02-06 01:02:53,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:02:53" (3/3) ... [2025-02-06 01:02:53,304 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-62.i [2025-02-06 01:02:53,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:02:53,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-62.i that has 2 procedures, 90 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:02:53,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:02:53,372 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;@4547d9ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:02:53,373 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:02:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:02:53,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:02:53,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:53,386 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:53,387 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:53,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:53,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1401716029, now seen corresponding path program 1 times [2025-02-06 01:02:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:02:53,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402883557] [2025-02-06 01:02:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:53,399 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:02:53,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:02:53,403 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:02:53,404 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:02:53,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:55,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:55,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:55,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:55,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:02:55,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:02:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 1282 trivial. 0 not checked. [2025-02-06 01:02:55,229 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:02:55,230 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:02:55,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402883557] [2025-02-06 01:02:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402883557] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:02:55,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:02:55,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:02:55,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12559187] [2025-02-06 01:02:55,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:02:55,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:02:55,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:02:55,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:02:55,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:02:55,250 INFO L87 Difference]: Start difference. First operand has 90 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 01:02:55,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:02:55,270 INFO L93 Difference]: Finished difference Result 174 states and 307 transitions. [2025-02-06 01:02:55,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:02:55,272 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 191 [2025-02-06 01:02:55,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:02:55,276 INFO L225 Difference]: With dead ends: 174 [2025-02-06 01:02:55,276 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 01:02:55,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:02:55,280 INFO L435 NwaCegarLoop]: 135 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, 135 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:02:55,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:02:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 01:02:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 01:02:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:02:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 135 transitions. [2025-02-06 01:02:55,318 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 135 transitions. Word has length 191 [2025-02-06 01:02:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:02:55,320 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 135 transitions. [2025-02-06 01:02:55,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-06 01:02:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 135 transitions. [2025-02-06 01:02:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:02:55,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:02:55,325 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:02:55,391 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 (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:02:55,526 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:02:55,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:02:55,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:02:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1835758341, now seen corresponding path program 1 times [2025-02-06 01:02:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:02:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490857094] [2025-02-06 01:02:55,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:02:55,530 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:02:55,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:02:55,535 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:02:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:02:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:02:57,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:02:57,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:02:57,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:02:57,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:02:57,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:03:03,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 869 proven. 51 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-02-06 01:03:03,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:03:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 36 proven. 51 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-02-06 01:03:09,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:03:09,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490857094] [2025-02-06 01:03:09,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490857094] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:03:09,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:03:09,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-06 01:03:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551583294] [2025-02-06 01:03:09,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:03:09,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:03:09,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:03:09,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:03:09,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:03:09,072 INFO L87 Difference]: Start difference. First operand 87 states and 135 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 01:03:18,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:03:22,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:03:26,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:03:31,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.62s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:03:35,320 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:03:39,335 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:03:39,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:03:39,339 INFO L93 Difference]: Finished difference Result 179 states and 274 transitions. [2025-02-06 01:03:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:03:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 191 [2025-02-06 01:03:39,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:03:39,592 INFO L225 Difference]: With dead ends: 179 [2025-02-06 01:03:39,592 INFO L226 Difference]: Without dead ends: 95 [2025-02-06 01:03:39,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 374 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:03:39,594 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 128 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 31 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:03:39,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 231 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 29.4s Time] [2025-02-06 01:03:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-06 01:03:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2025-02-06 01:03:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 58 states have internal predecessors, (76), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-02-06 01:03:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 136 transitions. [2025-02-06 01:03:39,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 136 transitions. Word has length 191 [2025-02-06 01:03:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:03:39,613 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 136 transitions. [2025-02-06 01:03:39,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (47), 2 states have call predecessors, (47), 4 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-02-06 01:03:39,613 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 136 transitions. [2025-02-06 01:03:39,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 01:03:39,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:03:39,622 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:03:39,685 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:03:39,822 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:03:39,823 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:03:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:03:39,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2028985244, now seen corresponding path program 1 times [2025-02-06 01:03:39,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:03:39,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928846153] [2025-02-06 01:03:39,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:03:39,827 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:03:39,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:03:39,830 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:03:39,835 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:03:39,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:03:41,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:03:41,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:03:41,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:03:41,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 01:03:41,673 INFO L279 TraceCheckSpWp]: Computing forward predicates...