./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.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-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:57:03,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:57:03,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 00:57:03,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:57:03,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:57:03,585 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:57:03,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:57:03,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:57:03,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:57:03,589 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:57:03,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:57:03,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:57:03,590 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:57:03,590 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:57:03,590 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:57:03,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:57:03,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:57:03,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:57:03,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:57:03,591 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:57:03,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:57:03,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:57:03,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:57:03,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:57:03,593 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2025-02-06 00:57:03,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:57:03,865 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:57:03,867 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:57:03,868 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:57:03,868 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:57:03,869 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-25.i [2025-02-06 00:57:05,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9074caafb/f6e9d2bba90846e4b8302e29a390b5e5/FLAG6d89158b1 [2025-02-06 00:57:05,458 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:57:05,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2025-02-06 00:57:05,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9074caafb/f6e9d2bba90846e4b8302e29a390b5e5/FLAG6d89158b1 [2025-02-06 00:57:05,490 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9074caafb/f6e9d2bba90846e4b8302e29a390b5e5 [2025-02-06 00:57:05,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:57:05,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:57:05,497 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:57:05,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:57:05,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:57:05,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,504 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05, skipping insertion in model container [2025-02-06 00:57:05,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,533 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:57:05,660 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-25.i[916,929] [2025-02-06 00:57:05,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:57:05,749 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:57:05,759 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-25.i[916,929] [2025-02-06 00:57:05,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:57:05,815 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:57:05,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05 WrapperNode [2025-02-06 00:57:05,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:57:05,818 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:57:05,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:57:05,819 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:57:05,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,887 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2025-02-06 00:57:05,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:57:05,888 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:57:05,888 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:57:05,888 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:57:05,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,906 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,934 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 00:57:05,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,944 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,946 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:57:05,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:57:05,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:57:05,949 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:57:05,950 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (1/1) ... [2025-02-06 00:57:05,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:57:05,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:57:05,984 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 00:57:05,992 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 00:57:06,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:57:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:57:06,011 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:57:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 00:57:06,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:57:06,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:57:06,104 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:57:06,106 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:57:06,626 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-06 00:57:06,627 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:57:06,641 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:57:06,642 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:57:06,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:06 BoogieIcfgContainer [2025-02-06 00:57:06,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:57:06,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:57:06,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:57:06,650 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:57:06,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:57:05" (1/3) ... [2025-02-06 00:57:06,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bda1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:06, skipping insertion in model container [2025-02-06 00:57:06,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:05" (2/3) ... [2025-02-06 00:57:06,652 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bda1f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:06, skipping insertion in model container [2025-02-06 00:57:06,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:06" (3/3) ... [2025-02-06 00:57:06,655 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2025-02-06 00:57:06,668 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:57:06,670 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:57:06,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:57:06,746 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;@3add5042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:57:06,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:57:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:06,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 00:57:06,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:06,767 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:06,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:06,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-02-06 00:57:06,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:06,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040708247] [2025-02-06 00:57:06,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:06,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 00:57:06,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 00:57:06,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:06,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:07,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 00:57:07,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:07,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040708247] [2025-02-06 00:57:07,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040708247] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:57:07,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187035978] [2025-02-06 00:57:07,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:07,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:57:07,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:57:07,141 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 00:57:07,143 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 00:57:07,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 00:57:07,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 00:57:07,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:07,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:07,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:57:07,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-06 00:57:07,436 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:57:07,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187035978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:07,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:57:07,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 00:57:07,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808147254] [2025-02-06 00:57:07,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:57:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:07,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:57:07,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:57:07,463 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:57:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:07,486 INFO L93 Difference]: Finished difference Result 160 states and 271 transitions. [2025-02-06 00:57:07,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:57:07,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-02-06 00:57:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:07,494 INFO L225 Difference]: With dead ends: 160 [2025-02-06 00:57:07,494 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 00:57:07,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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 00:57:07,499 INFO L435 NwaCegarLoop]: 121 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, 121 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 00:57:07,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:57:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 00:57:07,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 00:57:07,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-02-06 00:57:07,549 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-02-06 00:57:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:07,550 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-02-06 00:57:07,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:57:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-02-06 00:57:07,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 00:57:07,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:07,556 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:07,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 00:57:07,757 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 00:57:07,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:07,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:07,758 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-02-06 00:57:07,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:07,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599063051] [2025-02-06 00:57:07,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:07,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:07,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 00:57:07,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 00:57:07,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:07,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:08,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:08,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:08,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599063051] [2025-02-06 00:57:08,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599063051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:08,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:08,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:57:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105411409] [2025-02-06 00:57:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:08,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:57:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:08,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:57:08,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:57:08,112 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:08,164 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-02-06 00:57:08,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:57:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-02-06 00:57:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:08,169 INFO L225 Difference]: With dead ends: 188 [2025-02-06 00:57:08,170 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 00:57:08,171 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 00:57:08,171 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:08,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 231 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:57:08,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 00:57:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-02-06 00:57:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-02-06 00:57:08,184 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-02-06 00:57:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:08,185 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-02-06 00:57:08,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:08,188 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-02-06 00:57:08,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:08,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:08,195 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:08,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 00:57:08,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:08,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-02-06 00:57:08,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:08,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841771857] [2025-02-06 00:57:08,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:08,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:08,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:08,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:08,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:12,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841771857] [2025-02-06 00:57:12,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841771857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:12,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:12,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:57:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697881032] [2025-02-06 00:57:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:12,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:57:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:12,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:57:12,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:57:12,569 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:13,385 INFO L93 Difference]: Finished difference Result 365 states and 554 transitions. [2025-02-06 00:57:13,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 00:57:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:13,400 INFO L225 Difference]: With dead ends: 365 [2025-02-06 00:57:13,400 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 00:57:13,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:57:13,402 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 171 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:13,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 419 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:57:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 00:57:13,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 168. [2025-02-06 00:57:13,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 117 states have internal predecessors, (160), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:57:13,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2025-02-06 00:57:13,443 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 165 [2025-02-06 00:57:13,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:13,443 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2025-02-06 00:57:13,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:13,444 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2025-02-06 00:57:13,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:13,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:13,448 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:13,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 00:57:13,448 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:13,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:13,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1405927024, now seen corresponding path program 1 times [2025-02-06 00:57:13,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:13,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924179319] [2025-02-06 00:57:13,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:13,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:13,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:13,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:13,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:13,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:17,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:17,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:17,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924179319] [2025-02-06 00:57:17,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924179319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:17,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:17,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 00:57:17,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722887219] [2025-02-06 00:57:17,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:17,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 00:57:17,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:17,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 00:57:17,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:57:17,121 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:18,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:18,059 INFO L93 Difference]: Finished difference Result 365 states and 552 transitions. [2025-02-06 00:57:18,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 00:57:18,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:18,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:18,062 INFO L225 Difference]: With dead ends: 365 [2025-02-06 00:57:18,062 INFO L226 Difference]: Without dead ends: 266 [2025-02-06 00:57:18,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:57:18,063 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 171 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:18,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 472 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 00:57:18,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-02-06 00:57:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 170. [2025-02-06 00:57:18,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 119 states have (on average 1.361344537815126) internal successors, (162), 119 states have internal predecessors, (162), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-06 00:57:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2025-02-06 00:57:18,084 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 165 [2025-02-06 00:57:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:18,087 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2025-02-06 00:57:18,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2025-02-06 00:57:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:18,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:18,089 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:18,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 00:57:18,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:18,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1081585809, now seen corresponding path program 1 times [2025-02-06 00:57:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196830427] [2025-02-06 00:57:18,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:18,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:18,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:18,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:18,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:18,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:18,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196830427] [2025-02-06 00:57:18,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196830427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:18,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:18,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 00:57:18,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126369924] [2025-02-06 00:57:18,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:18,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:57:18,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:18,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:57:18,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:57:18,532 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:18,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:18,584 INFO L93 Difference]: Finished difference Result 355 states and 534 transitions. [2025-02-06 00:57:18,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:57:18,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:18,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:18,588 INFO L225 Difference]: With dead ends: 355 [2025-02-06 00:57:18,588 INFO L226 Difference]: Without dead ends: 238 [2025-02-06 00:57:18,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 00:57:18,589 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 42 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:18,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 363 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:57:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-02-06 00:57:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 224. [2025-02-06 00:57:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 169 states have (on average 1.3727810650887573) internal successors, (232), 170 states have internal predecessors, (232), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:57:18,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 332 transitions. [2025-02-06 00:57:18,609 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 332 transitions. Word has length 165 [2025-02-06 00:57:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 332 transitions. [2025-02-06 00:57:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 332 transitions. [2025-02-06 00:57:18,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:18,613 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:18,613 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:18,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 00:57:18,614 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:18,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:18,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-02-06 00:57:18,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:18,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210155279] [2025-02-06 00:57:18,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:18,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:18,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:18,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:18,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:18,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:18,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210155279] [2025-02-06 00:57:18,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210155279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:18,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:18,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 00:57:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532791634] [2025-02-06 00:57:18,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:18,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 00:57:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:18,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 00:57:18,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 00:57:18,890 INFO L87 Difference]: Start difference. First operand 224 states and 332 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:19,147 INFO L93 Difference]: Finished difference Result 507 states and 752 transitions. [2025-02-06 00:57:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 00:57:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:19,155 INFO L225 Difference]: With dead ends: 507 [2025-02-06 00:57:19,156 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 00:57:19,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 00:57:19,157 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 176 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:19,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 499 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 00:57:19,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 00:57:19,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 282. [2025-02-06 00:57:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 227 states have (on average 1.4008810572687225) internal successors, (318), 228 states have internal predecessors, (318), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:57:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 418 transitions. [2025-02-06 00:57:19,185 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 418 transitions. Word has length 165 [2025-02-06 00:57:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:19,185 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 418 transitions. [2025-02-06 00:57:19,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 418 transitions. [2025-02-06 00:57:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:19,188 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:19,188 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:19,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 00:57:19,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:19,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:19,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-02-06 00:57:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:19,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176992823] [2025-02-06 00:57:19,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:19,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:19,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:19,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:19,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:19,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 00:57:19,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176992823] [2025-02-06 00:57:19,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176992823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:19,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:19,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 00:57:19,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019469195] [2025-02-06 00:57:19,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:19,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 00:57:19,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 00:57:19,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 00:57:19,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 00:57:19,426 INFO L87 Difference]: Start difference. First operand 282 states and 418 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:19,760 INFO L93 Difference]: Finished difference Result 507 states and 749 transitions. [2025-02-06 00:57:19,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 00:57:19,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:19,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:19,764 INFO L225 Difference]: With dead ends: 507 [2025-02-06 00:57:19,764 INFO L226 Difference]: Without dead ends: 364 [2025-02-06 00:57:19,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:57:19,765 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 214 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:19,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 506 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 00:57:19,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-02-06 00:57:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 258. [2025-02-06 00:57:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 203 states have (on average 1.3793103448275863) internal successors, (280), 204 states have internal predecessors, (280), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:57:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 380 transitions. [2025-02-06 00:57:19,780 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 380 transitions. Word has length 165 [2025-02-06 00:57:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 380 transitions. [2025-02-06 00:57:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2025-02-06 00:57:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:19,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:19,784 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:19,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 00:57:19,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:19,785 INFO L85 PathProgramCache]: Analyzing trace with hash 576027184, now seen corresponding path program 1 times [2025-02-06 00:57:19,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 00:57:19,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61688582] [2025-02-06 00:57:19,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:19,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 00:57:19,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:20,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:20,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:20,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 00:57:20,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451962190] [2025-02-06 00:57:20,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:20,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:57:20,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:57:20,084 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 00:57:20,086 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 00:57:20,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:20,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:20,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:20,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:57:20,310 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 00:57:20,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:20,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:20,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:20,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 00:57:20,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 00:57:20,543 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 00:57:20,544 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 00:57:20,554 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 00:57:20,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 00:57:20,749 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 00:57:20,890 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 00:57:20,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 12:57:20 BoogieIcfgContainer [2025-02-06 00:57:20,893 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 00:57:20,894 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 00:57:20,894 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 00:57:20,894 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 00:57:20,895 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:06" (3/4) ... [2025-02-06 00:57:20,896 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 00:57:20,897 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 00:57:20,898 INFO L158 Benchmark]: Toolchain (without parser) took 15403.44ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 104.6MB in the beginning and 339.2MB in the end (delta: -234.6MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,898 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:57:20,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 89.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.54ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 00:57:20,898 INFO L158 Benchmark]: Boogie Preprocessor took 60.46ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 79.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,899 INFO L158 Benchmark]: IcfgBuilder took 694.46ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 52.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,899 INFO L158 Benchmark]: TraceAbstraction took 14247.78ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 51.4MB in the beginning and 343.6MB in the end (delta: -292.1MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,899 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 478.2MB. Free memory was 339.4MB in the beginning and 339.2MB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 00:57:20,900 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.57ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 89.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.54ms. Allocated memory is still 142.6MB. Free memory was 89.0MB in the beginning and 85.0MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.46ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 79.6MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 694.46ms. Allocated memory is still 142.6MB. Free memory was 79.6MB in the beginning and 52.5MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14247.78ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 51.4MB in the beginning and 343.6MB in the end (delta: -292.1MB). Peak memory consumption was 47.3MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 478.2MB. Free memory was 339.4MB in the beginning and 339.2MB in the end (delta: 152.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 165, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someBinaryDOUBLEComparisonOperation at line 172, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 170, overapproximation of someBinaryDOUBLEComparisonOperation at line 64, overapproximation of someBinaryDOUBLEComparisonOperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 152, overapproximation of someBinaryDOUBLEComparisonOperation at line 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 174. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -256; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] double var_1_7 = 256.25; [L27] double var_1_8 = 127.8; [L28] signed short int var_1_10 = -2; [L29] signed short int var_1_11 = 5; [L30] signed short int var_1_12 = 16; [L31] unsigned long int var_1_13 = 1000000000; [L32] signed long int var_1_14 = -100000000; [L33] double var_1_16 = 50.8; [L34] double var_1_17 = 2.2; [L35] double var_1_18 = 2.675; [L36] double var_1_19 = 100.5; [L37] unsigned short int var_1_20 = 46250; [L38] double var_1_21 = 99999999999.75; [L39] double var_1_22 = 32.4; [L40] double var_1_23 = 15.25; [L41] signed short int var_1_24 = -100; [L42] signed char var_1_25 = -1; [L43] unsigned short int var_1_26 = 128; [L44] unsigned long int var_1_27 = 8; [L45] signed short int var_1_28 = -4; [L46] unsigned long int var_1_29 = 100; [L47] unsigned long int var_1_30 = 100; [L48] unsigned long int var_1_31 = 1000000000; [L49] double var_1_32 = 0.0; [L50] signed long int last_1_var_1_1 = -64; [L51] signed long int last_1_var_1_14 = -100000000; [L52] double last_1_var_1_16 = 50.8; [L53] signed short int last_1_var_1_24 = -100; [L54] signed short int last_1_var_1_28 = -4; [L55] unsigned long int last_1_var_1_29 = 100; [L56] unsigned long int last_1_var_1_30 = 100; VAL [isInitial=0, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_14 = var_1_14 [L186] last_1_var_1_16 = var_1_16 [L187] last_1_var_1_24 = var_1_24 [L188] last_1_var_1_28 = var_1_28 [L189] last_1_var_1_29 = var_1_29 [L190] last_1_var_1_30 = var_1_30 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=1, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_5 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L144] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L145] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=1, var_1_7=1025/4, var_1_8=639/5] [L146] var_1_6 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L147] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_7=1025/4, var_1_8=639/5] [L148] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L148] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_7=1025/4, var_1_8=639/5] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L150] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0, var_1_8=639/5] [L151] var_1_8 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L152] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854776000e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-2, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L153] var_1_10 = __VERIFIER_nondet_short() [L154] CALL assume_abort_if_not(var_1_10 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L154] RET assume_abort_if_not(var_1_10 >= -16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] CALL assume_abort_if_not(var_1_10 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L155] RET assume_abort_if_not(var_1_10 <= 16383) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=5, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L156] var_1_11 = __VERIFIER_nondet_short() [L157] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L157] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] CALL assume_abort_if_not(var_1_11 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L158] RET assume_abort_if_not(var_1_11 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=16, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L159] var_1_12 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] CALL assume_abort_if_not(var_1_12 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L161] RET assume_abort_if_not(var_1_12 <= 32766) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=11/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L162] var_1_17 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L163] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_18=107/40, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L164] var_1_18 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L165] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=46250, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L166] var_1_20 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_20 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L167] RET assume_abort_if_not(var_1_20 >= 32767) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] CALL assume_abort_if_not(var_1_20 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L168] RET assume_abort_if_not(var_1_20 <= 65535) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_21=399999999999/4, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L170] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_22=162/5, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L171] var_1_22 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L172] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_23=61/4, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L173] var_1_23 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L174] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=-1, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L175] var_1_25 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_25 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L176] RET assume_abort_if_not(var_1_25 >= -128) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L177] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] CALL assume_abort_if_not(var_1_25 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L178] RET assume_abort_if_not(var_1_25 != 0) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=1000000000, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L179] var_1_31 = __VERIFIER_nondet_ulong() [L180] CALL assume_abort_if_not(var_1_31 >= 536870912) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L180] RET assume_abort_if_not(var_1_31 >= 536870912) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] CALL assume_abort_if_not(var_1_31 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L181] RET assume_abort_if_not(var_1_31 <= 1073741823) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L201] RET updateVariables() [L202] CALL step() [L60] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_2=0, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L61] COND FALSE !(var_1_5 && stepLocal_2) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-256, var_1_5=0, var_1_6=0] [L64] COND TRUE (var_1_7 - var_1_8) > last_1_var_1_16 [L65] var_1_4 = ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L70] unsigned char stepLocal_6 = (var_1_12 / var_1_25) != (last_1_var_1_1 * 16); VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_6=1, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=128, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L71] COND FALSE !(stepLocal_6 && var_1_6) [L78] var_1_26 = last_1_var_1_29 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L80] signed long int stepLocal_5 = var_1_20 / var_1_25; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_5=258, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-100, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L81] COND TRUE stepLocal_5 > var_1_26 [L82] var_1_24 = var_1_11 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L84] unsigned short int stepLocal_7 = var_1_26; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_7=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-4, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L85] COND TRUE (last_1_var_1_28 + (- var_1_10)) > stepLocal_7 [L86] var_1_28 = (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L88] signed long int stepLocal_4 = 128; [L89] signed short int stepLocal_3 = var_1_4; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_3=-1, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=201/2, var_1_1=-64, var_1_20=32767, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L90] COND FALSE !(var_1_26 <= stepLocal_3) [L97] var_1_19 = var_1_22 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=0, var_1_4=-1, var_1_5=0, var_1_6=0] [L99] COND TRUE (~ var_1_11) >= (~ var_1_20) [L100] var_1_32 = var_1_17 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=-100000000, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L102] COND FALSE !(\read(var_1_6)) [L105] var_1_14 = (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=1000000000, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L107] var_1_13 = (var_1_14 + var_1_12) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L108] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L113] signed long int stepLocal_1 = var_1_14; [L114] signed long int stepLocal_0 = var_1_14; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_1=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L115] COND FALSE !(! (var_1_14 >= var_1_4)) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_1=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-64, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L120] COND FALSE !(var_1_4 >= stepLocal_1) [L123] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=100, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L126] var_1_29 = (var_1_1 + 4u) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=254/5, var_1_17=3, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L127] COND TRUE (var_1_28 + (var_1_29 + var_1_26)) < var_1_4 [L128] var_1_16 = ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L130] unsigned long int stepLocal_9 = var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12))); [L131] unsigned char stepLocal_8 = var_1_6; VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, stepLocal_8=0, stepLocal_9=32764, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L132] COND FALSE !(stepLocal_8 || var_1_5) [L139] var_1_30 = ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, stepLocal_0=99999901, stepLocal_4=128, stepLocal_9=32764, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L202] RET step() [L203] CALL, EXPR property() [L193-L194] return (((((((((((((! (var_1_14 >= var_1_4)) ? ((256 != var_1_14) ? (var_1_1 == ((signed long int) (var_1_4 + var_1_14))) : 1) : ((var_1_4 >= var_1_14) ? (var_1_1 == ((signed long int) var_1_14)) : (var_1_1 == ((signed long int) var_1_4)))) && ((var_1_5 && var_1_6) ? (var_1_4 == ((signed short int) ((((last_1_var_1_24) < (-100)) ? (last_1_var_1_24) : (-100))))) : (((var_1_7 - var_1_8) > last_1_var_1_16) ? (var_1_4 == ((signed short int) ((((((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) > ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4))))) ? (((last_1_var_1_30 - last_1_var_1_24) + var_1_10)) : ((((((var_1_11 - var_1_12)) > (4)) ? ((var_1_11 - var_1_12)) : (4)))))))) : (var_1_4 == ((signed short int) (last_1_var_1_30 + ((((var_1_10) > (last_1_var_1_24)) ? (var_1_10) : (last_1_var_1_24))))))))) && (var_1_13 == ((unsigned long int) (var_1_14 + var_1_12)))) && (var_1_6 ? (var_1_14 == ((signed long int) (var_1_4 - last_1_var_1_14))) : (var_1_14 == ((signed long int) (((((var_1_4) > (var_1_12)) ? (var_1_4) : (var_1_12))) - (last_1_var_1_14 + var_1_26)))))) && (((var_1_28 + (var_1_29 + var_1_26)) < var_1_4) ? (var_1_16 == ((double) ((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))))) : 1)) && ((var_1_26 <= var_1_4) ? (((var_1_26 / (var_1_20 - 25)) >= 128) ? (var_1_19 == ((double) (((((15.25 - var_1_21) < 0 ) ? -(15.25 - var_1_21) : (15.25 - var_1_21))) - (var_1_22 + var_1_23)))) : (var_1_19 == ((double) var_1_22))) : (var_1_19 == ((double) var_1_22)))) && (((var_1_20 / var_1_25) > var_1_26) ? (var_1_24 == ((signed short int) var_1_11)) : 1)) && ((((var_1_12 / var_1_25) != (last_1_var_1_1 * 16)) && var_1_6) ? (var_1_6 ? (var_1_26 == ((unsigned short int) var_1_12)) : (var_1_26 == ((unsigned short int) last_1_var_1_29))) : (var_1_26 == ((unsigned short int) last_1_var_1_29)))) && (var_1_5 ? (((var_1_12 * var_1_13) >= var_1_11) ? (var_1_27 == ((unsigned long int) var_1_26)) : 1) : 1)) && (((last_1_var_1_28 + (- var_1_10)) > var_1_26) ? (var_1_28 == ((signed short int) (((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) - var_1_26))) : 1)) && (var_1_29 == ((unsigned long int) (var_1_1 + 4u)))) && ((var_1_6 || var_1_5) ? (((var_1_20 - ((((var_1_29) > (var_1_12)) ? (var_1_29) : (var_1_12)))) >= var_1_11) ? (var_1_30 == ((unsigned long int) var_1_29)) : (var_1_30 == ((unsigned long int) (((((var_1_20) > (var_1_4)) ? (var_1_20) : (var_1_4))) + ((1000000000u + var_1_31) - var_1_29))))) : (var_1_30 == ((unsigned long int) ((((var_1_26) > (var_1_29)) ? (var_1_26) : (var_1_29))))))) && (((~ var_1_11) >= (~ var_1_20)) ? (var_1_32 == ((double) var_1_17)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-100000000, last_1_var_1_16=254/5, last_1_var_1_1=-64, last_1_var_1_24=-100, last_1_var_1_28=-4, last_1_var_1_29=100, last_1_var_1_30=100, var_1_10=-201, var_1_11=-1, var_1_12=1, var_1_13=99999902, var_1_14=99999901, var_1_16=3, var_1_17=3, var_1_18=0, var_1_19=2, var_1_1=-1, var_1_20=32767, var_1_22=2, var_1_24=-1, var_1_25=127, var_1_26=100, var_1_27=8, var_1_28=-101, var_1_29=3, var_1_30=100, var_1_31=536870912, var_1_32=3, var_1_4=-1, var_1_5=0, var_1_6=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 810 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 810 mSDsluCounter, 2611 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1610 mSDsCounter, 326 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 880 IncrementalHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 326 mSolverCounterUnsat, 1001 mSDtfsCounter, 880 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=6, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 405 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1647 NumberOfCodeBlocks, 1647 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1309 ConstructedInterpolants, 0 QuantifiedInterpolants, 19543 SizeOfPredicates, 0 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 8786/8832 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 00:57:20,941 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-25.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 c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 00:57:23,122 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 00:57:23,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 00:57:23,230 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 00:57:23,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 00:57:23,254 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 00:57:23,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 00:57:23,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 00:57:23,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 00:57:23,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 00:57:23,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 00:57:23,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 00:57:23,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 00:57:23,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 00:57:23,256 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 00:57:23,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 00:57:23,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 00:57:23,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 00:57:23,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 00:57:23,258 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 00:57:23,258 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 00:57:23,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 00:57:23,260 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 00:57:23,260 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 00:57:23,260 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 00:57:23,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 00:57:23,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 00:57:23,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 00:57:23,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:57:23,261 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 00:57:23,261 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 00:57:23,261 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 00:57:23,261 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 00:57:23,261 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 00:57:23,262 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 00:57:23,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 00:57:23,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 00:57:23,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 00:57:23,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 00:57:23,262 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 -> c147c84511e5c0677a9069c27a4d754d19564d6e4b1f08886ba1a76b5d6b51d6 [2025-02-06 00:57:23,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 00:57:23,559 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 00:57:23,563 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 00:57:23,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 00:57:23,565 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 00:57:23,566 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-25.i [2025-02-06 00:57:24,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbd21d4d/b1e0cb9bea3b4415a7caee429b2d69aa/FLAGd00db5366 [2025-02-06 00:57:25,137 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 00:57:25,137 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-25.i [2025-02-06 00:57:25,147 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbd21d4d/b1e0cb9bea3b4415a7caee429b2d69aa/FLAGd00db5366 [2025-02-06 00:57:25,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1dbd21d4d/b1e0cb9bea3b4415a7caee429b2d69aa [2025-02-06 00:57:25,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 00:57:25,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 00:57:25,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 00:57:25,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 00:57:25,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 00:57:25,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7817f23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25, skipping insertion in model container [2025-02-06 00:57:25,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 00:57:25,335 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-25.i[916,929] [2025-02-06 00:57:25,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:57:25,444 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 00:57:25,455 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-25.i[916,929] [2025-02-06 00:57:25,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 00:57:25,516 INFO L204 MainTranslator]: Completed translation [2025-02-06 00:57:25,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25 WrapperNode [2025-02-06 00:57:25,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 00:57:25,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 00:57:25,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 00:57:25,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 00:57:25,526 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,583 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2025-02-06 00:57:25,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 00:57:25,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 00:57:25,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 00:57:25,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 00:57:25,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,603 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,633 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 00:57:25,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,650 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,655 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,658 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 00:57:25,670 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 00:57:25,670 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 00:57:25,670 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 00:57:25,671 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (1/1) ... [2025-02-06 00:57:25,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 00:57:25,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 00:57:25,703 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 00:57:25,707 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 00:57:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 00:57:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 00:57:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 00:57:25,729 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 00:57:25,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 00:57:25,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 00:57:25,803 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 00:57:25,804 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 00:57:32,273 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-02-06 00:57:32,273 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 00:57:32,285 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 00:57:32,285 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 00:57:32,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:32 BoogieIcfgContainer [2025-02-06 00:57:32,285 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 00:57:32,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 00:57:32,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 00:57:32,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 00:57:32,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 12:57:25" (1/3) ... [2025-02-06 00:57:32,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f868c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:32, skipping insertion in model container [2025-02-06 00:57:32,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 12:57:25" (2/3) ... [2025-02-06 00:57:32,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f868c4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 12:57:32, skipping insertion in model container [2025-02-06 00:57:32,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 12:57:32" (3/3) ... [2025-02-06 00:57:32,296 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-25.i [2025-02-06 00:57:32,306 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 00:57:32,307 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-25.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 00:57:32,352 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 00:57:32,362 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;@3f422b37, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 00:57:32,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 00:57:32,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:32,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 00:57:32,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:32,391 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:32,391 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:32,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:32,395 INFO L85 PathProgramCache]: Analyzing trace with hash 796266895, now seen corresponding path program 1 times [2025-02-06 00:57:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:57:32,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034172011] [2025-02-06 00:57:32,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:32,405 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 00:57:32,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:57:32,407 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 00:57:32,409 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 00:57:32,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 00:57:32,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 00:57:32,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:32,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:32,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 00:57:32,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 406 proven. 0 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2025-02-06 00:57:32,947 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:57:32,948 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:57:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034172011] [2025-02-06 00:57:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034172011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:32,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 00:57:32,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991287888] [2025-02-06 00:57:32,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:32,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 00:57:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:57:32,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 00:57:32,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 00:57:32,968 INFO L87 Difference]: Start difference. First operand has 83 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 57 states have internal predecessors, (78), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:57:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:32,991 INFO L93 Difference]: Finished difference Result 160 states and 271 transitions. [2025-02-06 00:57:32,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 00:57:32,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 164 [2025-02-06 00:57:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:32,999 INFO L225 Difference]: With dead ends: 160 [2025-02-06 00:57:32,999 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 00:57:33,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 163 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 00:57:33,005 INFO L435 NwaCegarLoop]: 121 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, 121 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 00:57:33,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 00:57:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 00:57:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-02-06 00:57:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 54 states have internal predecessors, (73), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2025-02-06 00:57:33,052 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 121 transitions. Word has length 164 [2025-02-06 00:57:33,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:33,052 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 121 transitions. [2025-02-06 00:57:33,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:57:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 121 transitions. [2025-02-06 00:57:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-06 00:57:33,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:33,056 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:33,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 00:57:33,256 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 00:57:33,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:33,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash -675309101, now seen corresponding path program 1 times [2025-02-06 00:57:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:57:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485788872] [2025-02-06 00:57:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:33,258 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 00:57:33,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:57:33,261 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 00:57:33,262 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 00:57:33,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-06 00:57:33,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-06 00:57:33,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:33,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:33,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 00:57:33,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:33,935 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 00:57:33,935 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:57:33,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485788872] [2025-02-06 00:57:33,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485788872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 00:57:33,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 00:57:33,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 00:57:33,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977461717] [2025-02-06 00:57:33,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 00:57:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:57:33,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 00:57:33,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 00:57:33,940 INFO L87 Difference]: Start difference. First operand 80 states and 121 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:37,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:57:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:37,816 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2025-02-06 00:57:37,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 00:57:37,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2025-02-06 00:57:37,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:37,859 INFO L225 Difference]: With dead ends: 188 [2025-02-06 00:57:37,859 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 00:57:37,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 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 00:57:37,861 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 36 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:37,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 230 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-06 00:57:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 00:57:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 102. [2025-02-06 00:57:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-06 00:57:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 155 transitions. [2025-02-06 00:57:37,874 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 155 transitions. Word has length 164 [2025-02-06 00:57:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:37,876 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 155 transitions. [2025-02-06 00:57:37,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 155 transitions. [2025-02-06 00:57:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:37,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:37,878 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:37,896 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 00:57:38,079 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 00:57:38,079 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:38,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1889471889, now seen corresponding path program 1 times [2025-02-06 00:57:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:57:38,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172365618] [2025-02-06 00:57:38,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:38,081 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 00:57:38,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:57:38,083 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 00:57:38,084 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 00:57:38,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:38,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:38,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:38,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:38,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 00:57:38,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2025-02-06 00:57:40,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:57:41,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-06 00:57:41,061 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:57:41,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172365618] [2025-02-06 00:57:41,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172365618] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 00:57:41,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 00:57:41,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-02-06 00:57:41,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488341899] [2025-02-06 00:57:41,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 00:57:41,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 00:57:41,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:57:41,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 00:57:41,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 00:57:41,064 INFO L87 Difference]: Start difference. First operand 102 states and 155 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:43,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:57:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:57:43,832 INFO L93 Difference]: Finished difference Result 256 states and 387 transitions. [2025-02-06 00:57:43,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 00:57:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2025-02-06 00:57:43,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:57:43,877 INFO L225 Difference]: With dead ends: 256 [2025-02-06 00:57:43,877 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 00:57:43,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:57:43,880 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 43 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 00:57:43,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 373 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 00:57:43,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 00:57:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2025-02-06 00:57:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 118 states have internal predecessors, (164), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-06 00:57:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2025-02-06 00:57:43,897 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 165 [2025-02-06 00:57:43,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:57:43,897 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2025-02-06 00:57:43,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-06 00:57:43,897 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2025-02-06 00:57:43,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:57:43,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:57:43,903 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:57:43,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 00:57:44,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:57:44,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:57:44,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:57:44,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1899936782, now seen corresponding path program 1 times [2025-02-06 00:57:44,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:57:44,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934763590] [2025-02-06 00:57:44,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:44,105 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 00:57:44,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:57:44,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 00:57:44,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 00:57:44,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:44,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:44,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:44,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:44,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 00:57:44,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-06 00:57:48,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:57:49,840 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:57:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934763590] [2025-02-06 00:57:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934763590] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:57:49,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470804677] [2025-02-06 00:57:49,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:57:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 00:57:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 00:57:49,853 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 00:57:49,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 00:57:49,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:57:51,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:57:51,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:57:51,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:57:51,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 00:57:51,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:57:55,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-06 00:57:55,017 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:57:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470804677] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:57:55,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 00:57:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2025-02-06 00:57:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746307906] [2025-02-06 00:57:55,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 00:57:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 00:57:55,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 00:57:55,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 00:57:55,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 00:57:55,929 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:58:02,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 00:58:06,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-02-06 00:58:11,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:58:12,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 00:58:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 00:58:13,748 INFO L93 Difference]: Finished difference Result 505 states and 746 transitions. [2025-02-06 00:58:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 00:58:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2025-02-06 00:58:13,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 00:58:13,753 INFO L225 Difference]: With dead ends: 505 [2025-02-06 00:58:13,753 INFO L226 Difference]: Without dead ends: 362 [2025-02-06 00:58:13,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-06 00:58:13,755 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 251 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 77 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2025-02-06 00:58:13,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 672 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 358 Invalid, 2 Unknown, 0 Unchecked, 17.2s Time] [2025-02-06 00:58:13,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-02-06 00:58:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 232. [2025-02-06 00:58:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 176 states have (on average 1.3693181818181819) internal successors, (241), 177 states have internal predecessors, (241), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 00:58:13,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 341 transitions. [2025-02-06 00:58:13,798 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 341 transitions. Word has length 165 [2025-02-06 00:58:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 00:58:13,799 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 341 transitions. [2025-02-06 00:58:13,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (24), 2 states have call predecessors, (24), 3 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-06 00:58:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 341 transitions. [2025-02-06 00:58:13,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-06 00:58:13,802 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 00:58:13,803 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:58:13,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-02-06 00:58:14,020 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 (5)] Ended with exit code 0 [2025-02-06 00:58:14,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 00:58:14,204 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 00:58:14,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 00:58:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1911485649, now seen corresponding path program 1 times [2025-02-06 00:58:14,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 00:58:14,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228726505] [2025-02-06 00:58:14,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:58:14,205 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 00:58:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 00:58:14,208 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 00:58:14,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 00:58:14,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:58:14,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:58:14,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:58:14,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:58:14,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 00:58:14,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 00:58:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-06 00:58:18,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 00:58:20,813 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 00:58:20,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228726505] [2025-02-06 00:58:20,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228726505] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 00:58:20,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1399995069] [2025-02-06 00:58:20,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 00:58:20,814 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 00:58:20,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 00:58:20,816 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 00:58:20,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-02-06 00:58:20,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 00:58:23,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 00:58:23,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 00:58:23,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 00:58:23,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 00:58:23,121 INFO L279 TraceCheckSpWp]: Computing forward predicates...