./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_50-1loop_file-80.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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:47:26,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:47:26,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:47:26,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:47:26,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:47:26,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:47:26,984 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:47:26,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:47:26,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:47:26,985 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:47:26,985 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:47:26,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:47:26,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:47:26,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:47:26,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:47:26,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:47:26,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:26,988 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:26,988 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:47:26,988 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:47:26,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:47:26,989 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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2025-01-09 13:47:27,238 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:47:27,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:47:27,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:47:27,246 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:47:27,247 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:47:27,248 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:28,404 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d173efb4/26009b3fc75b42808a6f57ff8338f24f/FLAG92214addb [2025-01-09 13:47:28,685 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:47:28,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:28,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d173efb4/26009b3fc75b42808a6f57ff8338f24f/FLAG92214addb [2025-01-09 13:47:28,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d173efb4/26009b3fc75b42808a6f57ff8338f24f [2025-01-09 13:47:28,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:47:28,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:47:28,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:47:28,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:47:28,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:47:28,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f8c3be7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28, skipping insertion in model container [2025-01-09 13:47:28,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,731 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:47:28,830 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_50-1loop_file-80.i[915,928] [2025-01-09 13:47:28,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:47:28,875 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:47:28,883 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_50-1loop_file-80.i[915,928] [2025-01-09 13:47:28,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:47:28,918 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:47:28,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28 WrapperNode [2025-01-09 13:47:28,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:47:28,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:47:28,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:47:28,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:47:28,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,959 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-01-09 13:47:28,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:47:28,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:47:28,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:47:28,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:47:28,967 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,986 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-01-09 13:47:28,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,992 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:28,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:29,000 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:29,003 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:29,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:29,009 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:47:29,012 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:47:29,013 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:47:29,013 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:47:29,014 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (1/1) ... [2025-01-09 13:47:29,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:29,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:47:29,049 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-01-09 13:47:29,058 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-01-09 13:47:29,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:47:29,074 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:47:29,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:47:29,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:47:29,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:47:29,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:47:29,137 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:47:29,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:47:29,352 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:47:29,353 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:47:29,360 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:47:29,360 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:47:29,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:47:29 BoogieIcfgContainer [2025-01-09 13:47:29,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:47:29,363 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:47:29,363 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:47:29,366 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:47:29,366 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:47:28" (1/3) ... [2025-01-09 13:47:29,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c82f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:47:29, skipping insertion in model container [2025-01-09 13:47:29,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:28" (2/3) ... [2025-01-09 13:47:29,367 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56c82f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:47:29, skipping insertion in model container [2025-01-09 13:47:29,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:47:29" (3/3) ... [2025-01-09 13:47:29,368 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:29,378 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:47:29,380 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:47:29,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:47:29,426 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;@3d98322e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:47:29,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:47:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:29,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:29,434 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:29,435 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:29,435 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:29,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:29,438 INFO L85 PathProgramCache]: Analyzing trace with hash -41989380, now seen corresponding path program 1 times [2025-01-09 13:47:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:47:29,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489556643] [2025-01-09 13:47:29,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:29,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:47:29,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:29,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:29,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:29,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:29,674 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 13:47:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:47:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489556643] [2025-01-09 13:47:29,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489556643] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:47:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958529973] [2025-01-09 13:47:29,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:29,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:47:29,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:47:29,680 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-01-09 13:47:29,685 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-01-09 13:47:29,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:29,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:29,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:29,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:29,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:47:29,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:47:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 13:47:29,873 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:47:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958529973] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:47:29,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:47:29,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:47:29,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252392676] [2025-01-09 13:47:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:47:29,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:47:29,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:47:29,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:47:29,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:47:29,909 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:47:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:47:29,930 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2025-01-09 13:47:29,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:47:29,932 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-01-09 13:47:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:47:29,937 INFO L225 Difference]: With dead ends: 117 [2025-01-09 13:47:29,938 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:47:29,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 126 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-01-09 13:47:29,942 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-01-09 13:47:29,944 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-01-09 13:47:29,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:47:29,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:47:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-01-09 13:47:29,973 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-01-09 13:47:29,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:47:29,973 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-01-09 13:47:29,973 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:47:29,974 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-01-09 13:47:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:29,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:29,975 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:29,987 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-01-09 13:47:30,176 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-01-09 13:47:30,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:30,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:30,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1501744762, now seen corresponding path program 1 times [2025-01-09 13:47:30,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:47:30,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117566060] [2025-01-09 13:47:30,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:30,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:47:30,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:30,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:30,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:30,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:47:30,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:47:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117566060] [2025-01-09 13:47:30,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117566060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:47:30,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:47:30,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:47:30,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272401475] [2025-01-09 13:47:30,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:47:30,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:47:30,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:47:30,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:47:30,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:47:30,389 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:47:30,416 INFO L93 Difference]: Finished difference Result 111 states and 165 transitions. [2025-01-09 13:47:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:47:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 13:47:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:47:30,420 INFO L225 Difference]: With dead ends: 111 [2025-01-09 13:47:30,422 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:47:30,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:47:30,424 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:47:30,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:47:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:47:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:47:30,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.25) internal successors, (45), 36 states have internal predecessors, (45), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2025-01-09 13:47:30,435 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 125 [2025-01-09 13:47:30,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:47:30,437 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2025-01-09 13:47:30,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2025-01-09 13:47:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:30,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:30,440 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:30,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:47:30,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1243579324, now seen corresponding path program 1 times [2025-01-09 13:47:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:47:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842786655] [2025-01-09 13:47:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:47:30,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:30,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:30,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:30,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:47:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:47:30,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842786655] [2025-01-09 13:47:30,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842786655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:47:30,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:47:30,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:47:30,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557907370] [2025-01-09 13:47:30,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:47:30,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:47:30,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:47:30,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:47:30,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:47:30,661 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:47:30,712 INFO L93 Difference]: Finished difference Result 111 states and 163 transitions. [2025-01-09 13:47:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:47:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 13:47:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:47:30,716 INFO L225 Difference]: With dead ends: 111 [2025-01-09 13:47:30,716 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:47:30,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:47:30,718 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 80 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:47:30,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 153 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:47:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:47:30,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:47:30,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2025-01-09 13:47:30,731 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 125 [2025-01-09 13:47:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:47:30,734 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2025-01-09 13:47:30,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2025-01-09 13:47:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:30,735 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:30,736 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:30,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:47:30,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:30,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 850552314, now seen corresponding path program 1 times [2025-01-09 13:47:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:47:30,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971744435] [2025-01-09 13:47:30,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:30,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:47:30,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:30,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:30,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:30,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:47:30,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:47:30,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971744435] [2025-01-09 13:47:30,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971744435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:47:30,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:47:30,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:47:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047600583] [2025-01-09 13:47:30,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:47:30,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:47:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:47:30,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:47:30,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:47:30,990 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:47:31,021 INFO L93 Difference]: Finished difference Result 111 states and 161 transitions. [2025-01-09 13:47:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:47:31,022 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 13:47:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:47:31,024 INFO L225 Difference]: With dead ends: 111 [2025-01-09 13:47:31,024 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:47:31,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:47:31,025 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:47:31,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 73 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:47:31,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:47:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:47:31,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 78 transitions. [2025-01-09 13:47:31,040 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 78 transitions. Word has length 125 [2025-01-09 13:47:31,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:47:31,041 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 78 transitions. [2025-01-09 13:47:31,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:47:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2025-01-09 13:47:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 13:47:31,045 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:31,045 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:31,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:47:31,046 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:31,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:31,046 INFO L85 PathProgramCache]: Analyzing trace with hash 440788023, now seen corresponding path program 1 times [2025-01-09 13:47:31,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:47:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014895031] [2025-01-09 13:47:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:31,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:47:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 13:47:31,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 13:47:31,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:31,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:47:31,144 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:47:31,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 13:47:31,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 13:47:31,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:31,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:47:31,259 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:47:31,259 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:47:31,260 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:47:31,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:47:31,264 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 13:47:31,347 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:47:31,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:47:31 BoogieIcfgContainer [2025-01-09 13:47:31,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:47:31,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:47:31,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:47:31,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:47:31,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:47:29" (3/4) ... [2025-01-09 13:47:31,352 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:47:31,353 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:47:31,353 INFO L158 Benchmark]: Toolchain (without parser) took 2641.85ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 64.1MB in the end (delta: 49.2MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2025-01-09 13:47:31,354 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:47:31,354 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.48ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 99.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:47:31,354 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.69ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:47:31,355 INFO L158 Benchmark]: Boogie Preprocessor took 50.53ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.5MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:47:31,355 INFO L158 Benchmark]: RCFGBuilder took 348.93ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 69.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:47:31,356 INFO L158 Benchmark]: TraceAbstraction took 1986.50ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 65.1MB in the end (delta: 3.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2025-01-09 13:47:31,356 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:47:31,357 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 125.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.48ms. Allocated memory is still 142.6MB. Free memory was 113.3MB in the beginning and 99.0MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.69ms. Allocated memory is still 142.6MB. Free memory was 99.0MB in the beginning and 96.0MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.53ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 89.5MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 348.93ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 69.9MB in the end (delta: 19.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1986.50ms. Allocated memory is still 142.6MB. Free memory was 69.0MB in the beginning and 65.1MB in the end (delta: 3.8MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 64.1MB in the end (delta: 1.1MB). 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 103, overapproximation of someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 122, overapproximation of someBinaryDOUBLEComparisonOperation at line 90, overapproximation of someBinaryDOUBLEComparisonOperation at line 63, overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 92, overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 59, overapproximation of someBinaryDOUBLEComparisonOperation at line 100, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 128; [L23] double var_1_2 = 24.25; [L24] double var_1_3 = 128.5; [L25] double var_1_4 = 4.5; [L26] double var_1_5 = 49.5; [L27] signed short int var_1_9 = -25; [L28] unsigned char var_1_10 = 200; [L29] unsigned char var_1_11 = 1; [L30] unsigned char var_1_12 = 1; [L31] double var_1_13 = 128.375; [L32] unsigned short int var_1_14 = 0; [L33] float var_1_15 = 0.0; [L34] float var_1_16 = 4.87; [L35] float var_1_17 = 8.875; [L36] signed short int var_1_18 = -128; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 1; [L39] unsigned char var_1_21 = 0; [L40] unsigned long int var_1_22 = 16; [L41] unsigned long int var_1_23 = 4200661734; [L42] unsigned char last_1_var_1_10 = 200; VAL [isInitial=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L126] isInitial = 1 [L127] FCALL initially() [L128] int k_loop; [L129] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L129] COND TRUE k_loop < 1 [L130] CALL updateLastVariables() [L119] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_2=97/4, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L130] RET updateLastVariables() [L131] CALL updateVariables() [L85] var_1_2 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L86] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_3=257/2, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L87] var_1_3 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L88] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_4=9/2, var_1_5=99/2, var_1_9=-25] [L89] var_1_4 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L90] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_5=99/2, var_1_9=-25] [L91] var_1_5 = __VERIFIER_nondet_double() [L92] 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, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L92] 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, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L93] var_1_11 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L94] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L95] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L96] var_1_12 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L97] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L98] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_13=1027/8, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L99] var_1_13 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L100] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L101] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_15=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L103] RET assume_abort_if_not((var_1_15 >= 4611686.018427387900e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_16=487/100, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L104] var_1_16 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L105] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_17=71/8, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L106] var_1_17 = __VERIFIER_nondet_float() [L107] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L107] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L111] var_1_21 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L112] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L113] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=4200661734, var_1_9=-25] [L114] var_1_23 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L115] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] CALL assume_abort_if_not(var_1_23 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L116] RET assume_abort_if_not(var_1_23 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L131] RET updateVariables() [L132] CALL step() [L46] signed long int stepLocal_0 = last_1_var_1_10; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_0=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-25] [L47] COND TRUE stepLocal_0 >= last_1_var_1_10 [L48] var_1_9 = (-256 + last_1_var_1_10) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L52] signed short int stepLocal_1 = var_1_9; VAL [isInitial=1, last_1_var_1_10=200, stepLocal_1=-56, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L53] COND FALSE !(stepLocal_1 > 0) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L56] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=200, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L59] COND TRUE ! (var_1_5 > (255.9 / var_1_13)) [L60] var_1_10 = var_1_12 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L63] COND TRUE ((var_1_2 - var_1_3) * var_1_4) < var_1_5 [L64] var_1_1 = ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L68] COND FALSE !((var_1_17 <= (- var_1_16)) && var_1_19) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=16, var_1_23=-2, var_1_9=-56] [L71] COND FALSE !(\read(var_1_19)) [L74] var_1_22 = (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10))) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L76] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=0, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L77] COND TRUE ((var_1_15 - var_1_16) - var_1_17) <= var_1_13 [L78] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L132] RET step() [L133] CALL, EXPR property() [L122-L123] return (((((((((var_1_2 - var_1_3) * var_1_4) < var_1_5) ? (var_1_1 == ((signed short int) ((((-8) < ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10)))))) ? (-8) : ((var_1_10 + ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))))))) : (var_1_1 == ((signed short int) var_1_10))) && ((last_1_var_1_10 >= last_1_var_1_10) ? (var_1_9 == ((signed short int) (-256 + last_1_var_1_10))) : (var_1_9 == ((signed short int) (last_1_var_1_10 + last_1_var_1_10))))) && (var_1_19 ? (var_1_10 == ((unsigned char) ((((0) < (var_1_12)) ? (0) : (var_1_12))))) : ((! (var_1_5 > (255.9 / var_1_13))) ? (var_1_10 == ((unsigned char) var_1_12)) : 1))) && ((! var_1_19) ? ((((var_1_15 - var_1_16) - var_1_17) <= var_1_13) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (((var_1_17 <= (- var_1_16)) && var_1_19) ? (var_1_18 == ((signed short int) var_1_10)) : 1)) && ((var_1_9 > 0) ? (var_1_19 == ((unsigned char) ((var_1_5 >= (- var_1_15)) && (var_1_11 && (var_1_20 && var_1_21))))) : 1)) && (var_1_19 ? (var_1_22 == ((unsigned long int) (var_1_9 + var_1_10))) : (var_1_22 == ((unsigned long int) (((((var_1_23 - var_1_9)) < (var_1_10)) ? ((var_1_23 - var_1_9)) : (var_1_10)))))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=200, var_1_10=-202, var_1_11=1, var_1_12=-202, var_1_14=-128, var_1_18=-128, var_1_19=0, var_1_1=-8, var_1_20=1, var_1_21=0, var_1_22=54, var_1_23=-2, var_1_9=-56] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 118 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 319 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 752 NumberOfCodeBlocks, 752 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 620 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 293 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 3384/3420 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-01-09 13:47:31,382 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_50-1loop_file-80.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 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:47:33,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:47:33,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:47:33,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:47:33,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:47:33,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:47:33,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:47:33,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:47:33,449 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:47:33,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:47:33,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:47:33,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:47:33,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:47:33,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:47:33,450 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:47:33,451 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:33,451 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:47:33,451 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:33,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:47:33,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:47:33,452 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 -> 9f215a3195f16669cd0369343da702eef7a8739b39d0494b1bddf6755cbdfe03 [2025-01-09 13:47:33,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:47:33,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:47:33,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:47:33,716 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:47:33,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:47:33,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:34,934 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f71f76d/50872016a7444cd4817b53c41a6f7eec/FLAGb295ec0d2 [2025-01-09 13:47:35,168 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:47:35,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:35,179 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f71f76d/50872016a7444cd4817b53c41a6f7eec/FLAGb295ec0d2 [2025-01-09 13:47:35,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f9f71f76d/50872016a7444cd4817b53c41a6f7eec [2025-01-09 13:47:35,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:47:35,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:47:35,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:47:35,201 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:47:35,204 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:47:35,205 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,206 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2437eaf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35, skipping insertion in model container [2025-01-09 13:47:35,206 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:47:35,335 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-80.i[915,928] [2025-01-09 13:47:35,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:47:35,414 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:47:35,422 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_50-1loop_file-80.i[915,928] [2025-01-09 13:47:35,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:47:35,467 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:47:35,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35 WrapperNode [2025-01-09 13:47:35,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:47:35,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:47:35,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:47:35,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:47:35,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,511 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2025-01-09 13:47:35,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:47:35,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:47:35,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:47:35,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:47:35,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,524 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,534 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-01-09 13:47:35,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,541 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,542 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,544 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:47:35,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:47:35,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:47:35,549 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:47:35,550 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (1/1) ... [2025-01-09 13:47:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:47:35,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:47:35,589 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-01-09 13:47:35,592 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-01-09 13:47:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:47:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:47:35,608 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:47:35,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:47:35,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:47:35,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:47:35,659 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:47:35,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:47:58,570 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:47:58,571 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:47:58,579 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:47:58,581 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:47:58,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:47:58 BoogieIcfgContainer [2025-01-09 13:47:58,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:47:58,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:47:58,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:47:58,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:47:58,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:47:35" (1/3) ... [2025-01-09 13:47:58,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a425eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:47:58, skipping insertion in model container [2025-01-09 13:47:58,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:47:35" (2/3) ... [2025-01-09 13:47:58,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a425eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:47:58, skipping insertion in model container [2025-01-09 13:47:58,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:47:58" (3/3) ... [2025-01-09 13:47:58,591 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i [2025-01-09 13:47:58,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:47:58,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_50-1loop_file-80.i that has 2 procedures, 60 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:47:58,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:47:58,656 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;@529d1672, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:47:58,656 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:47:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:58,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:58,671 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:58,671 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:47:58,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:47:58,675 INFO L85 PathProgramCache]: Analyzing trace with hash -41989380, now seen corresponding path program 1 times [2025-01-09 13:47:58,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:47:58,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595619631] [2025-01-09 13:47:58,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:47:58,683 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-01-09 13:47:58,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:47:58,692 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-01-09 13:47:58,694 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-01-09 13:47:58,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:47:59,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:47:59,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:47:59,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:47:59,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:47:59,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:47:59,809 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2025-01-09 13:47:59,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:47:59,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:47:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595619631] [2025-01-09 13:47:59,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595619631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:47:59,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:47:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:47:59,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860834175] [2025-01-09 13:47:59,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:47:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:47:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:47:59,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:47:59,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:47:59,839 INFO L87 Difference]: Start difference. First operand has 60 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:47:59,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:47:59,860 INFO L93 Difference]: Finished difference Result 117 states and 194 transitions. [2025-01-09 13:47:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:47:59,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 125 [2025-01-09 13:47:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:47:59,865 INFO L225 Difference]: With dead ends: 117 [2025-01-09 13:47:59,866 INFO L226 Difference]: Without dead ends: 57 [2025-01-09 13:47:59,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 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-01-09 13:47:59,870 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-01-09 13:47:59,870 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-01-09 13:47:59,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-01-09 13:47:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-01-09 13:47:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 13:47:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 84 transitions. [2025-01-09 13:47:59,922 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 84 transitions. Word has length 125 [2025-01-09 13:47:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:47:59,923 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 84 transitions. [2025-01-09 13:47:59,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 13:47:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 84 transitions. [2025-01-09 13:47:59,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:47:59,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:47:59,925 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:47:59,952 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-01-09 13:48:00,130 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-01-09 13:48:00,130 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:48:00,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:48:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1501744762, now seen corresponding path program 1 times [2025-01-09 13:48:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:48:00,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516854593] [2025-01-09 13:48:00,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:48:00,132 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-01-09 13:48:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:48:00,134 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-01-09 13:48:00,136 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-01-09 13:48:00,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:48:01,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:48:01,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:48:01,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:48:01,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 13:48:01,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:48:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:48:04,181 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:48:04,181 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:48:04,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516854593] [2025-01-09 13:48:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516854593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:48:04,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:48:04,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:48:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663095679] [2025-01-09 13:48:04,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:48:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:48:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:48:04,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:48:04,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:48:04,189 INFO L87 Difference]: Start difference. First operand 57 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:48:09,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:11,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:15,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:19,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:22,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:26,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:30,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:34,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:38,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:42,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:46,882 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-01-09 13:48:50,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:54,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:48:58,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:49:02,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:49:06,789 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-01-09 13:49:10,792 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-01-09 13:49:10,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:49:10,793 INFO L93 Difference]: Finished difference Result 177 states and 263 transitions. [2025-01-09 13:49:10,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:49:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 125 [2025-01-09 13:49:10,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:49:10,912 INFO L225 Difference]: With dead ends: 177 [2025-01-09 13:49:10,912 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 13:49:10,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:49:10,913 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 66 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 39 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 65.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 66.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:49:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 289 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 66.3s Time] [2025-01-09 13:49:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 13:49:10,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2025-01-09 13:49:10,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 68 states have internal predecessors, (87), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 13:49:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 163 transitions. [2025-01-09 13:49:10,945 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 163 transitions. Word has length 125 [2025-01-09 13:49:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:49:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 163 transitions. [2025-01-09 13:49:10,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 13:49:10,947 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 163 transitions. [2025-01-09 13:49:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 13:49:10,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:49:10,949 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:49:10,977 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-01-09 13:49:11,150 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-01-09 13:49:11,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:49:11,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:49:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1243579324, now seen corresponding path program 1 times [2025-01-09 13:49:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:49:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90466972] [2025-01-09 13:49:11,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:49:11,155 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-01-09 13:49:11,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:49:11,157 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-01-09 13:49:11,158 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-01-09 13:49:11,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 13:49:12,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 13:49:12,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:49:12,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:49:12,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 13:49:12,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:49:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 13:49:12,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:49:12,424 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:49:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90466972] [2025-01-09 13:49:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90466972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:49:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:49:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:49:12,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378570246] [2025-01-09 13:49:12,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:49:12,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:49:12,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:49:12,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:49:12,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:49:12,426 INFO L87 Difference]: Start difference. First operand 109 states and 163 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19)