./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.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_25-while_file-51.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 e5d9c7ed889b184267cd622b8cedf0f63c83decc897ab4d06bfed69bff61102d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:31:00,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:31:00,251 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:31:00,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:31:00,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:31:00,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:31:00,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:31:00,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:31:00,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:31:00,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:31:00,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:31:00,279 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:31:00,279 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:31:00,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:31:00,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:31:00,281 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:31:00,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:31:00,282 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:31:00,282 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:31:00,282 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:31:00,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:00,283 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:00,283 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:31:00,283 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:31:00,284 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:31:00,284 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 -> e5d9c7ed889b184267cd622b8cedf0f63c83decc897ab4d06bfed69bff61102d [2025-01-09 13:31:00,491 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:31:00,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:31:00,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:31:00,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:31:00,498 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:31:00,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:01,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/698b473de/65e54ede2992425fb530f352fdb2d9b1/FLAG11080b7c6 [2025-01-09 13:31:01,847 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:31:01,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:01,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/698b473de/65e54ede2992425fb530f352fdb2d9b1/FLAG11080b7c6 [2025-01-09 13:31:02,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/698b473de/65e54ede2992425fb530f352fdb2d9b1 [2025-01-09 13:31:02,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:31:02,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:31:02,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:31:02,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:31:02,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:31:02,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f5808d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02, skipping insertion in model container [2025-01-09 13:31:02,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:31:02,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i[915,928] [2025-01-09 13:31:02,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:31:02,306 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:31:02,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i[915,928] [2025-01-09 13:31:02,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:31:02,335 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:31:02,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02 WrapperNode [2025-01-09 13:31:02,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:31:02,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:31:02,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:31:02,336 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:31:02,340 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:31:02" (1/1) ... [2025-01-09 13:31:02,344 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:31:02" (1/1) ... [2025-01-09 13:31:02,360 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 13:31:02,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:31:02,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:31:02,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:31:02,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:31:02,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,368 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,375 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:31:02,375 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,375 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,377 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,378 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,379 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:31:02,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:31:02,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:31:02,383 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:31:02,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (1/1) ... [2025-01-09 13:31:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:31:02,407 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:31:02,413 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:31:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:31:02,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:31:02,429 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:31:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:31:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:31:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:31:02,483 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:31:02,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:31:02,673 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:31:02,673 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:31:02,680 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:31:02,680 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:31:02,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:31:02 BoogieIcfgContainer [2025-01-09 13:31:02,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:31:02,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:31:02,683 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:31:02,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:31:02,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:31:02" (1/3) ... [2025-01-09 13:31:02,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d183f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:31:02, skipping insertion in model container [2025-01-09 13:31:02,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:02" (2/3) ... [2025-01-09 13:31:02,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d183f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:31:02, skipping insertion in model container [2025-01-09 13:31:02,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:31:02" (3/3) ... [2025-01-09 13:31:02,690 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:02,700 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:31:02,702 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:31:02,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:31:02,753 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;@4bcf2392, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:31:02,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:31:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:31:02,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:31:02,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:31:02,764 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:02,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:31:02,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:31:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1237969454, now seen corresponding path program 1 times [2025-01-09 13:31:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:31:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233410220] [2025-01-09 13:31:02,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:02,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:31:02,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:02,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:02,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:31:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:31:02,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:31:02,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233410220] [2025-01-09 13:31:02,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233410220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:31:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092199317] [2025-01-09 13:31:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:02,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:31:02,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:31:02,963 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:31:02,964 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:31:03,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:03,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:03,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:03,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:31:03,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:31:03,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:31:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-01-09 13:31:03,086 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:31:03,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092199317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:31:03,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:31:03,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:31:03,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311539471] [2025-01-09 13:31:03,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:31:03,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:31:03,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:31:03,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:31:03,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:31:03,109 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:31:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:31:03,128 INFO L93 Difference]: Finished difference Result 80 states and 129 transitions. [2025-01-09 13:31:03,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:31:03,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-01-09 13:31:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:31:03,136 INFO L225 Difference]: With dead ends: 80 [2025-01-09 13:31:03,136 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:31:03,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 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:31:03,140 INFO L435 NwaCegarLoop]: 56 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, 56 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:31:03,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:31:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:31:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:31:03,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:31:03,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-01-09 13:31:03,163 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-01-09 13:31:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:31:03,163 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-01-09 13:31:03,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:31:03,164 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-01-09 13:31:03,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:31:03,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:31:03,166 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:03,172 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:31:03,367 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:31:03,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:31:03,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:31:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -332843250, now seen corresponding path program 1 times [2025-01-09 13:31:03,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:31:03,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735146437] [2025-01-09 13:31:03,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:03,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:31:03,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:03,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:03,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:03,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:31:03,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1833979961] [2025-01-09 13:31:03,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:31:03,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:31:03,446 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:31:03,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 13:31:03,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:03,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:03,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:03,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:31:03,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:31:03,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:03,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:03,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:03,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:31:03,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:31:03,686 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:31:03,687 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:31:03,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:31:03,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:31:03,891 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-09 13:31:03,939 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:31:03,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:31:03 BoogieIcfgContainer [2025-01-09 13:31:03,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:31:03,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:31:03,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:31:03,946 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:31:03,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:31:02" (3/4) ... [2025-01-09 13:31:03,948 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:31:03,949 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:31:03,949 INFO L158 Benchmark]: Toolchain (without parser) took 1779.04ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 48.7MB in the end (delta: 86.7MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-01-09 13:31:03,950 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:31:03,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 160.68ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 123.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:31:03,951 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.68ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:31:03,951 INFO L158 Benchmark]: Boogie Preprocessor took 20.78ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 119.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:31:03,951 INFO L158 Benchmark]: RCFGBuilder took 298.77ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 105.3MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:31:03,952 INFO L158 Benchmark]: TraceAbstraction took 1262.69ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 48.7MB in the end (delta: 56.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 13:31:03,953 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 167.8MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:31:03,953 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 160.68ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 123.0MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.68ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 121.5MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.78ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 119.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.77ms. Allocated memory is still 167.8MB. Free memory was 119.6MB in the beginning and 105.3MB in the end (delta: 14.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1262.69ms. Allocated memory is still 167.8MB. Free memory was 104.7MB in the beginning and 48.7MB in the end (delta: 56.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 167.8MB. Free memory is still 48.7MB. 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 someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 10.8; [L23] unsigned char var_1_2 = 0; [L24] signed short int var_1_5 = -16; [L25] double var_1_6 = 100.01; [L26] unsigned short int var_1_7 = 50; [L27] signed short int var_1_8 = 5; [L28] unsigned short int var_1_9 = 256; [L29] signed long int var_1_10 = -100; [L30] unsigned long int var_1_12 = 10000000; [L31] unsigned short int var_1_13 = 2; [L32] unsigned short int var_1_14 = 4; [L33] double var_1_15 = 4.5; VAL [isInitial=0, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L89] isInitial = 1 [L90] FCALL initially() [L92] FCALL updateLastVariables() [L93] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=-16, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L66] var_1_5 = __VERIFIER_nondet_short() [L67] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L67] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L68] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L69] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=10001/100, var_1_7=50, var_1_8=5, var_1_9=256] [L70] var_1_6 = __VERIFIER_nondet_double() [L71] CALL assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=5, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=5, var_1_9=256] [L71] RET assume_abort_if_not((var_1_6 >= -922337.2036854765600e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=5, var_1_9=256] [L72] var_1_8 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_8 >= -32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L73] RET assume_abort_if_not(var_1_8 >= -32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L74] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L74] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=256] [L75] var_1_9 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2] [L77] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L77] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=4, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L78] var_1_14 = __VERIFIER_nondet_ushort() [L79] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L79] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L80] CALL assume_abort_if_not(var_1_14 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L80] RET assume_abort_if_not(var_1_14 <= 65534) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=50, var_1_8=2, var_1_9=-65536] [L93] RET updateVariables() [L94] CALL step() [L37] COND TRUE ! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8)))) [L38] var_1_7 = (var_1_9 + 1) VAL [isInitial=1, var_1_10=-100, var_1_12=10000000, var_1_13=2, var_1_14=0, var_1_15=9/2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_7=1, var_1_8=2, var_1_9=-65536] [L40] var_1_12 = var_1_9 [L41] var_1_13 = var_1_14 [L42] var_1_15 = var_1_6 [L43] unsigned long int stepLocal_0 = var_1_12; VAL [isInitial=1, stepLocal_0=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=54/5, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L44] COND FALSE !(\read(var_1_2)) [L51] var_1_1 = var_1_6 VAL [isInitial=1, stepLocal_0=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L53] unsigned char stepLocal_1 = (var_1_6 * var_1_15) >= var_1_1; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=-100, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L54] COND FALSE !(stepLocal_1 || var_1_2) [L59] var_1_10 = -1 VAL [isInitial=1, stepLocal_0=0, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L94] RET step() [L95] CALL, EXPR property() [L85-L86] return (((((var_1_2 ? ((var_1_12 >= (var_1_12 / var_1_5)) ? (var_1_1 == ((double) ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) : (var_1_1 == ((double) var_1_6))) : (var_1_1 == ((double) var_1_6))) && ((! (var_1_5 >= ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) ? (var_1_7 == ((unsigned short int) (var_1_9 + 1))) : 1)) && ((((var_1_6 * var_1_15) >= var_1_1) || var_1_2) ? ((var_1_6 <= var_1_1) ? (var_1_10 == ((signed long int) var_1_9)) : 1) : (var_1_10 == ((signed long int) -1)))) && (var_1_12 == ((unsigned long int) var_1_9))) && (var_1_13 == ((unsigned short int) var_1_14))) && (var_1_15 == ((double) var_1_6)) ; VAL [\result=0, isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L95] RET, EXPR property() [L95] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] [L19] reach_error() VAL [isInitial=1, var_1_10=-1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=2, var_1_1=2, var_1_2=0, var_1_5=1, var_1_6=2, var_1_7=1, var_1_8=2, var_1_9=-65536] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 2, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 56 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 158 ConstructedInterpolants, 0 QuantifiedInterpolants, 158 SizeOfPredicates, 0 NumberOfNonLiveVariables, 204 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 506/528 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:31:03,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.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 e5d9c7ed889b184267cd622b8cedf0f63c83decc897ab4d06bfed69bff61102d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:31:05,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:31:05,898 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:31:05,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:31:05,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:31:05,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:31:05,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:31:05,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:31:05,943 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:31:05,943 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:31:05,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:31:05,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:31:05,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:31:05,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:31:05,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:31:05,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:31:05,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:31:05,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:31:05,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:31:05,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:05,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:31:05,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:31:05,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:31:05,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:05,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:31:05,948 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:31:05,949 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 -> e5d9c7ed889b184267cd622b8cedf0f63c83decc897ab4d06bfed69bff61102d [2025-01-09 13:31:06,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:31:06,197 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:31:06,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:31:06,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:31:06,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:31:06,201 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:07,405 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b236f96/7d626487412241ff9594bcbe61c4c5bc/FLAG94dbacdb9 [2025-01-09 13:31:07,636 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:31:07,637 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:07,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b236f96/7d626487412241ff9594bcbe61c4c5bc/FLAG94dbacdb9 [2025-01-09 13:31:07,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7b236f96/7d626487412241ff9594bcbe61c4c5bc [2025-01-09 13:31:07,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:31:07,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:31:07,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:31:07,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:31:07,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:31:07,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cbe6a24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07, skipping insertion in model container [2025-01-09 13:31:07,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:31:07,772 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i[915,928] [2025-01-09 13:31:07,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:31:07,817 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:31:07,825 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-51.i[915,928] [2025-01-09 13:31:07,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:31:07,850 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:31:07,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07 WrapperNode [2025-01-09 13:31:07,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:31:07,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:31:07,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:31:07,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:31:07,855 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:31:07" (1/1) ... [2025-01-09 13:31:07,861 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:31:07" (1/1) ... [2025-01-09 13:31:07,871 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 89 [2025-01-09 13:31:07,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:31:07,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:31:07,872 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:31:07,872 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:31:07,877 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,884 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:31:07,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,888 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:31:07,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:31:07,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:31:07,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:31:07,896 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (1/1) ... [2025-01-09 13:31:07,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:31:07,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:31:07,924 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:31:07,927 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:31:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:31:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:31:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:31:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:31:07,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:31:07,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:31:07,991 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:31:07,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:31:11,211 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-09 13:31:11,211 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:31:11,221 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:31:11,221 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:31:11,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:31:11 BoogieIcfgContainer [2025-01-09 13:31:11,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:31:11,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:31:11,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:31:11,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:31:11,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:31:07" (1/3) ... [2025-01-09 13:31:11,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780a045e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:31:11, skipping insertion in model container [2025-01-09 13:31:11,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:31:07" (2/3) ... [2025-01-09 13:31:11,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@780a045e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:31:11, skipping insertion in model container [2025-01-09 13:31:11,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:31:11" (3/3) ... [2025-01-09 13:31:11,232 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-51.i [2025-01-09 13:31:11,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:31:11,245 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-51.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:31:11,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:31:11,295 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;@61c6f3a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:31:11,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:31:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:31:11,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:31:11,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:31:11,305 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:11,306 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:31:11,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:31:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1237969454, now seen corresponding path program 1 times [2025-01-09 13:31:11,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:31:11,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399802035] [2025-01-09 13:31:11,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:11,320 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:31:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:31:11,323 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:31:11,324 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:31:11,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:11,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:11,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:11,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:31:11,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:31:11,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:31:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2025-01-09 13:31:11,692 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:31:11,692 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:31:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399802035] [2025-01-09 13:31:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399802035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:31:11,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:31:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:31:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761669603] [2025-01-09 13:31:11,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:31:11,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:31:11,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:31:11,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:31:11,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:31:11,714 INFO L87 Difference]: Start difference. First operand has 43 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:31:11,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:31:11,731 INFO L93 Difference]: Finished difference Result 80 states and 129 transitions. [2025-01-09 13:31:11,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:31:11,733 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2025-01-09 13:31:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:31:11,737 INFO L225 Difference]: With dead ends: 80 [2025-01-09 13:31:11,737 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:31:11,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 79 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:31:11,741 INFO L435 NwaCegarLoop]: 56 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, 56 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:31:11,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:31:11,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:31:11,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:31:11,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-01-09 13:31:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 56 transitions. [2025-01-09 13:31:11,770 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 56 transitions. Word has length 80 [2025-01-09 13:31:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:31:11,771 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 56 transitions. [2025-01-09 13:31:11,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 13:31:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 56 transitions. [2025-01-09 13:31:11,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 13:31:11,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:31:11,774 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:11,784 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 13:31:11,975 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:31:11,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:31:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:31:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -332843250, now seen corresponding path program 1 times [2025-01-09 13:31:11,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:31:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1930781587] [2025-01-09 13:31:11,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:31:11,977 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:31:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:31:11,979 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:31:11,981 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:31:12,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 13:31:12,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 13:31:12,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:31:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:31:12,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 13:31:12,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:31:39,801 WARN L286 SmtUtils]: Spent 6.23s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 13:32:23,605 WARN L286 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)