./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e4821e04b31b9aaf394b8b78c510bc3814de3cef2581931733142dfd333ca56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:15:14,357 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:15:14,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:15:14,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:15:14,416 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:15:14,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:15:14,430 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:15:14,430 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:15:14,431 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:15:14,431 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:15:14,431 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:15:14,431 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:15:14,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:15:14,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:15:14,431 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:15:14,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:15:14,432 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:15:14,432 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:15:14,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:15:14,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:15:14,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:15:14,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:15:14,434 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 -> 4e4821e04b31b9aaf394b8b78c510bc3814de3cef2581931733142dfd333ca56 [2025-02-06 01:15:14,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:15:14,701 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:15:14,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:15:14,705 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:15:14,706 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:15:14,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:15,882 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf3cdc88b/fa4a17fd3f6640bc8990d9e3cc5bb6a6/FLAG0785f26a3 [2025-02-06 01:15:16,160 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:15:16,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:16,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf3cdc88b/fa4a17fd3f6640bc8990d9e3cc5bb6a6/FLAG0785f26a3 [2025-02-06 01:15:16,456 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf3cdc88b/fa4a17fd3f6640bc8990d9e3cc5bb6a6 [2025-02-06 01:15:16,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:15:16,460 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:15:16,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:15:16,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:15:16,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:15:16,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54cf3834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16, skipping insertion in model container [2025-02-06 01:15:16,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:15:16,622 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_25-1loop_file-72.i[915,928] [2025-02-06 01:15:16,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:15:16,688 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:15:16,703 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_25-1loop_file-72.i[915,928] [2025-02-06 01:15:16,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:15:16,748 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:15:16,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16 WrapperNode [2025-02-06 01:15:16,749 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:15:16,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:15:16,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:15:16,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:15:16,758 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,771 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,795 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 135 [2025-02-06 01:15:16,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:15:16,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:15:16,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:15:16,796 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:15:16,802 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,802 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:15:16,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,822 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,824 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:15:16,828 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:15:16,828 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:15:16,828 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:15:16,829 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (1/1) ... [2025-02-06 01:15:16,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:15:16,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:15:16,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:15:16,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:15:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:15:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:15:16,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:15:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:15:16,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:15:16,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:15:16,953 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:15:16,954 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:15:17,089 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 01:15:17,089 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:15:17,095 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:15:17,095 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:15:17,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:17 BoogieIcfgContainer [2025-02-06 01:15:17,095 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:15:17,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:15:17,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:15:17,102 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:15:17,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:15:16" (1/3) ... [2025-02-06 01:15:17,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa8a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:17, skipping insertion in model container [2025-02-06 01:15:17,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:16" (2/3) ... [2025-02-06 01:15:17,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23aa8a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:17, skipping insertion in model container [2025-02-06 01:15:17,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:17" (3/3) ... [2025-02-06 01:15:17,103 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:17,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:15:17,112 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-72.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:15:17,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:15:17,156 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;@617c8b22, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:15:17,156 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:15:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:15:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:15:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:15:17,167 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:15:17,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:15:17,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:15:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1040749203, now seen corresponding path program 1 times [2025-02-06 01:15:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:15:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227408245] [2025-02-06 01:15:17,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:17,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:15:17,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:17,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:17,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:17,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:15:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:15:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227408245] [2025-02-06 01:15:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227408245] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:15:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440723154] [2025-02-06 01:15:17,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:15:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:15:17,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:15:17,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:15:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:17,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:17,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:17,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:17,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:15:17,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:15:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:15:17,572 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:15:17,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440723154] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:15:17,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:15:17,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:15:17,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145274420] [2025-02-06 01:15:17,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:15:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:15:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:15:17,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:15:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:15:17,588 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:15:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:15:17,602 INFO L93 Difference]: Finished difference Result 119 states and 198 transitions. [2025-02-06 01:15:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:15:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-02-06 01:15:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:15:17,607 INFO L225 Difference]: With dead ends: 119 [2025-02-06 01:15:17,607 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 01:15:17,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:15:17,610 INFO L435 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:15:17,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:15:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 01:15:17,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 01:15:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:15:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-02-06 01:15:17,634 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2025-02-06 01:15:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:15:17,634 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-02-06 01:15:17,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:15:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-02-06 01:15:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:15:17,636 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:15:17,636 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:15:17,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 01:15:17,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:15:17,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:15:17,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:15:17,842 INFO L85 PathProgramCache]: Analyzing trace with hash 979548870, now seen corresponding path program 1 times [2025-02-06 01:15:17,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:15:17,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26159935] [2025-02-06 01:15:17,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:17,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:15:17,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:17,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:17,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:17,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 01:15:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:15:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26159935] [2025-02-06 01:15:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26159935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:15:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119848574] [2025-02-06 01:15:18,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:15:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:15:18,315 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:15:18,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:15:18,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:18,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:18,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:18,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 01:15:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:15:18,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-02-06 01:15:18,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:15:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 01:15:18,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119848574] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:15:18,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:15:18,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 01:15:18,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477405941] [2025-02-06 01:15:18,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:15:18,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:15:18,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:15:18,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:15:18,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:15:18,830 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-06 01:15:18,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:15:18,996 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2025-02-06 01:15:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:15:18,996 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2025-02-06 01:15:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:15:18,997 INFO L225 Difference]: With dead ends: 121 [2025-02-06 01:15:18,997 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 01:15:18,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:15:18,998 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:15:18,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 119 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:15:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 01:15:19,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-02-06 01:15:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:15:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-02-06 01:15:19,008 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2025-02-06 01:15:19,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:15:19,008 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-02-06 01:15:19,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-06 01:15:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-02-06 01:15:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:15:19,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:15:19,010 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:15:19,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 01:15:19,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:15:19,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:15:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:15:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1572608091, now seen corresponding path program 1 times [2025-02-06 01:15:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:15:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046797107] [2025-02-06 01:15:19,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:15:19,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:19,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:19,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:19,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:15:19,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 01:15:19,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:19,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:19,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:19,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 01:15:19,324 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 01:15:19,325 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 01:15:19,325 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:15:19,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:15:19,328 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-06 01:15:19,388 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:15:19,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:15:19 BoogieIcfgContainer [2025-02-06 01:15:19,394 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:15:19,394 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:15:19,394 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:15:19,394 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:15:19,395 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:17" (3/4) ... [2025-02-06 01:15:19,398 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 01:15:19,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:15:19,399 INFO L158 Benchmark]: Toolchain (without parser) took 2939.03ms. Allocated memory is still 167.8MB. Free memory was 122.0MB in the beginning and 67.7MB in the end (delta: 54.3MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2025-02-06 01:15:19,400 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 218.1MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:15:19,401 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.29ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 108.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:15:19,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.99ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:15:19,403 INFO L158 Benchmark]: Boogie Preprocessor took 31.71ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:15:19,403 INFO L158 Benchmark]: IcfgBuilder took 267.41ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 88.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:15:19,403 INFO L158 Benchmark]: TraceAbstraction took 2297.30ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 67.8MB in the end (delta: 20.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2025-02-06 01:15:19,404 INFO L158 Benchmark]: Witness Printer took 4.29ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:15:19,405 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.21ms. Allocated memory is still 218.1MB. Free memory is still 138.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.29ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 108.6MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.99ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.8MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.71ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 104.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 267.41ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 88.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2297.30ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 67.8MB in the end (delta: 20.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 4.29ms. Allocated memory is still 167.8MB. Free memory was 67.8MB in the beginning and 67.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 91, overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 102, overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 65, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] double var_1_2 = 128.875; [L24] double var_1_3 = 24.5; [L25] double var_1_4 = 8.2; [L26] double var_1_5 = 10.05; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 1; [L30] unsigned char var_1_9 = 0; [L31] unsigned long int var_1_10 = 2; [L32] signed char var_1_11 = -16; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -10; [L35] signed char var_1_14 = 4; [L36] double var_1_15 = 256.4; [L37] float var_1_16 = 0.25; [L38] double var_1_17 = 100000000000.2; [L39] double var_1_18 = 50.5; [L40] double var_1_19 = 9.5; VAL [isInitial=0, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_2=1031/8, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] int k_loop; [L109] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_2=1031/8, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L109] COND TRUE k_loop < 1 [L110] FCALL updateLastVariables() [L111] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L61] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_3=49/2, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L63] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_4=41/5, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L64] var_1_4 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L65] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_5=201/20, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L66] var_1_5 = __VERIFIER_nondet_double() [L67] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L67] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=0, var_1_7=0, var_1_8=1, var_1_9=0] [L68] var_1_6 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L69] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L70] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=0, var_1_8=1, var_1_9=0] [L71] var_1_7 = __VERIFIER_nondet_uchar() [L72] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L72] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_8=1, var_1_9=0] [L73] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L73] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L74] var_1_8 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L75] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_9=0] [L76] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L76] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1] [L79] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L79] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-2, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L80] var_1_12 = __VERIFIER_nondet_char() [L81] CALL assume_abort_if_not(var_1_12 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L81] RET assume_abort_if_not(var_1_12 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] CALL assume_abort_if_not(var_1_12 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_12 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-10, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L83] var_1_13 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L84] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L85] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=4, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L86] var_1_14 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L87] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L88] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_16=1/4, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L89] var_1_16 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L90] RET assume_abort_if_not((var_1_16 >= -922337.2036854776000e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854776000e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_16 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L91] RET assume_abort_if_not(var_1_16 != 0.0F) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_17=500000000001/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L92] var_1_17 = __VERIFIER_nondet_double() [L93] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L93] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_18=101/2, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L94] var_1_18 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L95] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_19=19/2, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L96] var_1_19 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L97] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L111] RET updateVariables() [L112] CALL step() [L44] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-16, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L47] var_1_11 = (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14)))) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L48] COND FALSE !((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=1, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L55] COND TRUE var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15) [L56] var_1_1 = (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L112] RET step() [L113] CALL, EXPR property() [L102-L103] return ((((var_1_15 < (((((var_1_15) < (var_1_15)) ? (var_1_15) : (var_1_15))) * var_1_15)) ? (var_1_1 == ((unsigned char) (var_1_6 && ((var_1_7 || var_1_8) && var_1_9)))) : 1) && (var_1_9 ? (var_1_10 == ((unsigned long int) 2u)) : 1)) && (var_1_11 == ((signed char) (((((var_1_12 + var_1_13)) < ((10 - var_1_14))) ? ((var_1_12 + var_1_13)) : ((10 - var_1_14))))))) && (((var_1_2 + (var_1_3 / var_1_16)) == var_1_5) ? ((var_1_3 >= var_1_4) ? (var_1_15 == ((double) (var_1_17 - (((((var_1_18 + var_1_19)) < (9.9999999999995E12)) ? ((var_1_18 + var_1_19)) : (9.9999999999995E12)))))) : (var_1_15 == ((double) var_1_17))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=-116, var_1_12=-53, var_1_13=-63, var_1_14=126, var_1_15=1282/5, var_1_1=0, var_1_6=1, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 206 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 63 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 128 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 143 mSDtfsCounter, 128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 437 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=2, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 710 ConstructedInterpolants, 0 QuantifiedInterpolants, 1172 SizeOfPredicates, 1 NumberOfNonLiveVariables, 628 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 4917/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-06 01:15:19,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e4821e04b31b9aaf394b8b78c510bc3814de3cef2581931733142dfd333ca56 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:15:21,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:15:21,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 01:15:21,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:15:21,513 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:15:21,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:15:21,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:15:21,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:15:21,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:15:21,536 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:15:21,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:15:21,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:15:21,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:15:21,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:15:21,537 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:15:21,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:15:21,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:15:21,539 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:15:21,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:15:21,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 01:15:21,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:15:21,541 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:15:21,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:15:21,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:15:21,541 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 -> 4e4821e04b31b9aaf394b8b78c510bc3814de3cef2581931733142dfd333ca56 [2025-02-06 01:15:21,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:15:21,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:15:21,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:15:21,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:15:21,803 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:15:21,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:22,956 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/def867373/4ffdbf55b57d40378b4024a936756b93/FLAG060dd56b4 [2025-02-06 01:15:23,166 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:15:23,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:23,177 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/def867373/4ffdbf55b57d40378b4024a936756b93/FLAG060dd56b4 [2025-02-06 01:15:23,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/def867373/4ffdbf55b57d40378b4024a936756b93 [2025-02-06 01:15:23,194 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:15:23,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:15:23,196 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:15:23,196 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:15:23,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:15:23,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f31ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23, skipping insertion in model container [2025-02-06 01:15:23,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:15:23,319 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_25-1loop_file-72.i[915,928] [2025-02-06 01:15:23,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:15:23,381 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:15:23,390 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_25-1loop_file-72.i[915,928] [2025-02-06 01:15:23,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:15:23,427 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:15:23,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23 WrapperNode [2025-02-06 01:15:23,429 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:15:23,430 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:15:23,430 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:15:23,430 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:15:23,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,443 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,466 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2025-02-06 01:15:23,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:15:23,469 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:15:23,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:15:23,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:15:23,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,482 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:15:23,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,498 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,508 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,514 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,515 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:15:23,520 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:15:23,520 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:15:23,520 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:15:23,521 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (1/1) ... [2025-02-06 01:15:23,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:15:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:15:23,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:15:23,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:15:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:15:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 01:15:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:15:23,569 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:15:23,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:15:23,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:15:23,635 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:15:23,636 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:15:38,579 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-06 01:15:38,580 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:15:38,588 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:15:38,588 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:15:38,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:38 BoogieIcfgContainer [2025-02-06 01:15:38,589 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:15:38,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:15:38,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:15:38,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:15:38,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:15:23" (1/3) ... [2025-02-06 01:15:38,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9b3d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:38, skipping insertion in model container [2025-02-06 01:15:38,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:15:23" (2/3) ... [2025-02-06 01:15:38,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9b3d42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:15:38, skipping insertion in model container [2025-02-06 01:15:38,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:15:38" (3/3) ... [2025-02-06 01:15:38,600 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-72.i [2025-02-06 01:15:38,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:15:38,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-72.i that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:15:38,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:15:38,659 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;@42f1a005, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:15:38,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:15:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:15:38,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:15:38,669 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:15:38,669 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:15:38,670 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:15:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:15:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1040749203, now seen corresponding path program 1 times [2025-02-06 01:15:38,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:15:38,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896139981] [2025-02-06 01:15:38,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:15:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:15:38,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:15:38,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-02-06 01:15:38,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:39,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:39,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:39,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:39,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:15:39,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:15:39,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-02-06 01:15:39,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:15:39,772 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:15:39,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896139981] [2025-02-06 01:15:39,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896139981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:15:39,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:15:39,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 01:15:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056994369] [2025-02-06 01:15:39,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:15:39,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:15:39,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:15:39,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:15:39,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:15:39,794 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 36 states have internal predecessors, (43), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:15:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:15:39,814 INFO L93 Difference]: Finished difference Result 119 states and 198 transitions. [2025-02-06 01:15:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:15:39,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 143 [2025-02-06 01:15:39,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:15:39,821 INFO L225 Difference]: With dead ends: 119 [2025-02-06 01:15:39,821 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 01:15:39,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:15:39,825 INFO L435 NwaCegarLoop]: 87 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, 87 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:15:39,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:15:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 01:15:39,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 01:15:39,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:15:39,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 84 transitions. [2025-02-06 01:15:39,877 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 84 transitions. Word has length 143 [2025-02-06 01:15:39,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:15:39,878 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 84 transitions. [2025-02-06 01:15:39,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:15:39,878 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 84 transitions. [2025-02-06 01:15:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:15:39,880 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:15:39,880 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:15:39,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 01:15:40,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:15:40,081 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:15:40,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:15:40,082 INFO L85 PathProgramCache]: Analyzing trace with hash 979548870, now seen corresponding path program 1 times [2025-02-06 01:15:40,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:15:40,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581166829] [2025-02-06 01:15:40,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:15:40,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:15:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:15:40,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:15:40,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 01:15:40,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:15:41,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:15:41,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:15:41,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:15:41,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 01:15:41,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:15:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-02-06 01:15:43,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:15:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-02-06 01:15:45,859 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 01:15:45,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581166829] [2025-02-06 01:15:45,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581166829] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:15:45,860 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 01:15:45,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-02-06 01:15:45,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257020691] [2025-02-06 01:15:45,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 01:15:45,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 01:15:45,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 01:15:45,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 01:15:45,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:15:45,862 INFO L87 Difference]: Start difference. First operand 58 states and 84 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-06 01:15:53,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:15:57,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:16:01,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-02-06 01:16:01,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:16:01,683 INFO L93 Difference]: Finished difference Result 121 states and 172 transitions. [2025-02-06 01:16:01,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 01:16:01,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 143 [2025-02-06 01:16:01,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:16:01,807 INFO L225 Difference]: With dead ends: 121 [2025-02-06 01:16:01,809 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 01:16:01,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 278 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:16:01,810 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:16:01,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 118 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2025-02-06 01:16:01,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 01:16:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2025-02-06 01:16:01,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:16:01,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2025-02-06 01:16:01,826 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 143 [2025-02-06 01:16:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:16:01,828 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2025-02-06 01:16:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-02-06 01:16:01,829 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2025-02-06 01:16:01,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-02-06 01:16:01,830 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:16:01,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:16:01,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 01:16:02,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:16:02,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:16:02,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:16:02,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1572608091, now seen corresponding path program 1 times [2025-02-06 01:16:02,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 01:16:02,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392710905] [2025-02-06 01:16:02,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:16:02,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 01:16:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 01:16:02,040 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 01:16:02,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 01:16:02,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-02-06 01:16:03,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-02-06 01:16:03,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:16:03,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:16:03,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 01:16:03,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:16:18,705 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:16:27,026 WARN L286 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:16:35,215 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:16:43,574 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:16:51,916 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-06 01:17:00,260 WARN L286 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)