./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.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-1loop_file-0.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 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:14:09,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:14:09,305 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:14:09,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:14:09,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:14:09,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:14:09,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:14:09,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:14:09,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:14:09,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:14:09,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:14:09,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:14:09,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:14:09,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:14:09,340 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:14:09,340 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:14:09,340 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:14:09,341 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:14:09,341 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:09,342 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:09,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:14:09,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:14:09,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:14:09,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:14:09,343 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 -> 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a [2025-01-09 13:14:09,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:14:09,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:14:09,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:14:09,566 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:14:09,567 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:14:09,567 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:10,765 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51fa4e1d/355c90ce34d543359c735d3c134a312c/FLAG30e19177a [2025-01-09 13:14:11,022 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:14:11,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:11,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51fa4e1d/355c90ce34d543359c735d3c134a312c/FLAG30e19177a [2025-01-09 13:14:11,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b51fa4e1d/355c90ce34d543359c735d3c134a312c [2025-01-09 13:14:11,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:14:11,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:14:11,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:11,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:14:11,359 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:14:11,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,360 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11, skipping insertion in model container [2025-01-09 13:14:11,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,370 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:14:11,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-01-09 13:14:11,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:11,536 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:14:11,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-01-09 13:14:11,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:11,560 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:14:11,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11 WrapperNode [2025-01-09 13:14:11,561 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:11,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:11,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:14:11,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:14:11,566 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:14:11" (1/1) ... [2025-01-09 13:14:11,570 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:14:11" (1/1) ... [2025-01-09 13:14:11,581 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 13:14:11,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:11,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:14:11,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:14:11,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:14:11,590 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,592 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,601 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:14:11,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,605 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,606 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,608 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:14:11,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:14:11,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:14:11,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:14:11,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (1/1) ... [2025-01-09 13:14:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:11,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:14:11,642 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:14:11,646 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:14:11,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:14:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:14:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:14:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:14:11,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:14:11,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:14:11,716 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:14:11,718 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:14:11,835 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:14:11,836 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:14:11,842 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:14:11,842 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:14:11,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:11 BoogieIcfgContainer [2025-01-09 13:14:11,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:14:11,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:14:11,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:14:11,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:14:11,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:14:11" (1/3) ... [2025-01-09 13:14:11,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f944f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:11, skipping insertion in model container [2025-01-09 13:14:11,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:11" (2/3) ... [2025-01-09 13:14:11,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f944f06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:11, skipping insertion in model container [2025-01-09 13:14:11,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:11" (3/3) ... [2025-01-09 13:14:11,852 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:11,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:14:11,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:14:11,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:14:11,924 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;@5b872fb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:14:11,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:14:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:11,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:11,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:11,935 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1884145557, now seen corresponding path program 1 times [2025-01-09 13:14:11,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:11,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462926628] [2025-01-09 13:14:11,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:12,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:12,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:12,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 13:14:12,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:14:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462926628] [2025-01-09 13:14:12,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462926628] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:14:12,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721595202] [2025-01-09 13:14:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:12,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:14:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:14:12,105 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:14:12,106 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:14:12,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:12,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:12,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:12,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:12,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:14:12,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:14:12,228 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-01-09 13:14:12,228 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:14:12,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721595202] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:12,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:14:12,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:14:12,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915758643] [2025-01-09 13:14:12,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:12,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:14:12,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:14:12,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:14:12,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:14:12,247 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:14:12,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:12,260 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2025-01-09 13:14:12,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:14:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 13:14:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:12,265 INFO L225 Difference]: With dead ends: 83 [2025-01-09 13:14:12,266 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:14:12,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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:14:12,269 INFO L435 NwaCegarLoop]: 58 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, 58 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:14:12,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:14:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:14:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:14:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-01-09 13:14:12,299 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-01-09 13:14:12,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:12,300 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-01-09 13:14:12,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:14:12,300 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-01-09 13:14:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:12,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:12,303 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 13:14:12,507 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:14:12,508 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:12,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -88086291, now seen corresponding path program 1 times [2025-01-09 13:14:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-01-09 13:14:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:12,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:12,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:12,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:12,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:12,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:12,625 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:14:12,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:14:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-01-09 13:14:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579255191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:14:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:14:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191252024] [2025-01-09 13:14:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:12,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:14:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:14:12,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:14:12,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:14:12,638 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:14:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:12,671 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2025-01-09 13:14:12,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:14:12,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 13:14:12,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:12,673 INFO L225 Difference]: With dead ends: 90 [2025-01-09 13:14:12,673 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 13:14:12,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:14:12,674 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:14:12,674 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 96 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:14:12,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 13:14:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-01-09 13:14:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-01-09 13:14:12,680 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 66 [2025-01-09 13:14:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:12,682 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-01-09 13:14:12,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:14:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-01-09 13:14:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:12,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:12,683 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:12,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:14:12,684 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:12,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash -768144661, now seen corresponding path program 1 times [2025-01-09 13:14:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:14:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018620117] [2025-01-09 13:14:12,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:12,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:14:12,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:12,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:12,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:14:12,752 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:14:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:12,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:12,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:12,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:14:12,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:14:12,805 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:14:12,806 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:14:12,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:14:12,809 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 13:14:12,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:14:12,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:14:12 BoogieIcfgContainer [2025-01-09 13:14:12,850 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:14:12,851 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:14:12,851 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:14:12,851 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:14:12,852 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:11" (3/4) ... [2025-01-09 13:14:12,854 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:14:12,855 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:14:12,856 INFO L158 Benchmark]: Toolchain (without parser) took 1500.26ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 96.9MB in the end (delta: 17.1MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2025-01-09 13:14:12,856 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:14:12,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.41ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:14:12,857 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.47ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:14:12,857 INFO L158 Benchmark]: Boogie Preprocessor took 28.91ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:14:12,857 INFO L158 Benchmark]: RCFGBuilder took 231.20ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 85.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:14:12,857 INFO L158 Benchmark]: TraceAbstraction took 1006.50ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 97.7MB in the end (delta: -12.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:14:12,858 INFO L158 Benchmark]: Witness Printer took 3.90ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.9MB in the end (delta: 829.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:14:12,858 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 205.41ms. Allocated memory is still 142.6MB. Free memory was 114.0MB in the beginning and 102.2MB in the end (delta: 11.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.47ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 100.5MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.91ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 98.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 231.20ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 85.4MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1006.50ms. Allocated memory is still 142.6MB. Free memory was 84.9MB in the beginning and 97.7MB in the end (delta: -12.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.90ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.9MB in the end (delta: 829.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 77, overapproximation of someBinaryDOUBLEComparisonOperation at line 66, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 48, overapproximation of someBinaryDOUBLEComparisonOperation at line 50, overapproximation of someBinaryDOUBLEComparisonOperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 40. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 25.8; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 128.2; [L25] double var_1_4 = 15.4; [L26] double var_1_5 = 5.25; [L27] unsigned char var_1_6 = 0; [L28] float var_1_7 = 8.125; [L29] float var_1_8 = 0.4; [L30] float var_1_9 = 499.4; [L31] float var_1_10 = 63.16; VAL [isInitial=0, var_1_10=1579/25, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L86] isInitial = 1 [L87] FCALL initially() [L88] int k_loop; [L89] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1579/25, var_1_1=129/5, var_1_2=1, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L89] COND TRUE k_loop < 1 [L90] FCALL updateLastVariables() [L91] CALL updateVariables() [L62] var_1_2 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L63] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L64] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_3=641/5, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L65] var_1_3 = __VERIFIER_nondet_double() [L66] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L66] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_4=77/5, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L67] var_1_4 = __VERIFIER_nondet_double() [L68] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L68] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=0, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_8=2/5, var_1_9=2497/5] [L72] var_1_8 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L73] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8, var_1_9=2497/5] [L74] var_1_9 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L75] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1579/25, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L76] var_1_10 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L77] RET assume_abort_if_not((var_1_10 >= -461168.6018427382800e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_1=129/5, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L91] RET updateVariables() [L92] CALL step() [L35] COND TRUE ! var_1_2 [L36] var_1_1 = (var_1_3 - var_1_4) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L40] unsigned char stepLocal_0 = var_1_4 < var_1_3; VAL [isInitial=1, stepLocal_0=0, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L41] COND FALSE !(stepLocal_0 || var_1_2) VAL [isInitial=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L48] unsigned char stepLocal_1 = var_1_1 <= (var_1_1 + var_1_3); VAL [isInitial=1, stepLocal_1=1, var_1_2=0, var_1_5=21/4, var_1_6=1, var_1_7=65/8] [L49] COND TRUE var_1_2 || stepLocal_1 [L50] var_1_7 = ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))) VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L92] RET step() [L93] CALL, EXPR property() [L82-L83] return (((! var_1_2) ? (var_1_1 == ((double) (var_1_3 - var_1_4))) : (var_1_1 == ((double) ((((16.2) < (var_1_3)) ? (16.2) : (var_1_3)))))) && (((var_1_4 < var_1_3) || var_1_2) ? (var_1_2 ? (var_1_6 ? (var_1_5 == ((double) var_1_3)) : 1) : 1) : 1)) && ((var_1_2 || (var_1_1 <= (var_1_1 + var_1_3))) ? (var_1_7 == ((float) ((((5.5f) < (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3))))) ? (5.5f) : (((((128.4f) > (var_1_3)) ? (128.4f) : (var_1_3)))))))) : (var_1_6 ? (var_1_7 == ((float) ((var_1_8 - var_1_9) + var_1_10))) : (var_1_2 ? (var_1_7 == ((float) var_1_9)) : 1))) ; VAL [\result=0, isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L93] RET, EXPR property() [L93] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] [L19] reach_error() VAL [isInitial=1, var_1_2=0, var_1_3=642/5, var_1_5=21/4, var_1_6=1, var_1_7=642/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 3, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 154 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 117 mSDtfsCounter, 14 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=2, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 205 SizeOfPredicates, 0 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 416/432 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:14:12,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.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 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:14:15,005 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:14:15,079 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:14:15,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:14:15,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:14:15,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:14:15,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:14:15,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:14:15,104 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:14:15,105 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:14:15,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:14:15,106 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:14:15,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:14:15,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:14:15,106 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:14:15,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:14:15,107 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:14:15,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:15,108 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:15,109 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:15,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:14:15,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:14:15,110 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:14:15,110 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 -> 828b6f31ac8b338b9524f85315068e4bc72bfadb1d19ff8ea6318f966a3b277a [2025-01-09 13:14:15,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:14:15,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:14:15,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:14:15,376 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:14:15,377 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:14:15,378 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:16,577 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0efa49353/5047300bd8bd45d9aaf74a47e7382025/FLAG6be2bc8c8 [2025-01-09 13:14:16,820 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:14:16,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:16,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0efa49353/5047300bd8bd45d9aaf74a47e7382025/FLAG6be2bc8c8 [2025-01-09 13:14:17,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0efa49353/5047300bd8bd45d9aaf74a47e7382025 [2025-01-09 13:14:17,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:14:17,180 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:14:17,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:17,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:14:17,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:14:17,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,185 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5b4ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17, skipping insertion in model container [2025-01-09 13:14:17,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:14:17,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-01-09 13:14:17,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:17,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:14:17,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-0.i[914,927] [2025-01-09 13:14:17,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:14:17,340 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:14:17,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17 WrapperNode [2025-01-09 13:14:17,341 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:14:17,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:17,342 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:14:17,342 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:14:17,345 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:14:17" (1/1) ... [2025-01-09 13:14:17,351 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:14:17" (1/1) ... [2025-01-09 13:14:17,363 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-09 13:14:17,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:14:17,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:14:17,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:14:17,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:14:17,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,378 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:14:17,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,384 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:14:17,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:14:17,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:14:17,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:14:17,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (1/1) ... [2025-01-09 13:14:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:14:17,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:14:17,412 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:14:17,414 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:14:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:14:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:14:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:14:17,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:14:17,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:14:17,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:14:17,486 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:14:17,487 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:14:21,476 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-01-09 13:14:21,477 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:14:21,488 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:14:21,488 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 13:14:21,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:21 BoogieIcfgContainer [2025-01-09 13:14:21,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:14:21,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:14:21,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:14:21,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:14:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:14:17" (1/3) ... [2025-01-09 13:14:21,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9f8f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:21, skipping insertion in model container [2025-01-09 13:14:21,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:14:17" (2/3) ... [2025-01-09 13:14:21,498 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f9f8f41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:14:21, skipping insertion in model container [2025-01-09 13:14:21,499 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:14:21" (3/3) ... [2025-01-09 13:14:21,500 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i [2025-01-09 13:14:21,510 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:14:21,512 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-0.i that has 2 procedures, 43 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:14:21,545 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:14:21,553 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;@6a2d0902, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:14:21,553 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:14:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:21,561 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:21,561 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:21,562 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:21,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1884145557, now seen corresponding path program 1 times [2025-01-09 13:14:21,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:14:21,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593456363] [2025-01-09 13:14:21,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:21,573 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:14:21,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:14:21,594 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:14:21,595 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:14:21,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:21,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:21,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:21,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:14:21,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:14:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-09 13:14:21,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:14:21,959 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:14:21,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593456363] [2025-01-09 13:14:21,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593456363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:21,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:14:21,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 13:14:21,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472241764] [2025-01-09 13:14:21,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:14:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:14:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:14:21,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:14:21,976 INFO L87 Difference]: Start difference. First operand has 43 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:14:21,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:21,988 INFO L93 Difference]: Finished difference Result 83 states and 126 transitions. [2025-01-09 13:14:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:14:21,989 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2025-01-09 13:14:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:21,993 INFO L225 Difference]: With dead ends: 83 [2025-01-09 13:14:21,993 INFO L226 Difference]: Without dead ends: 40 [2025-01-09 13:14:21,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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:14:21,996 INFO L435 NwaCegarLoop]: 58 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, 58 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:14:21,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:14:22,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-01-09 13:14:22,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-01-09 13:14:22,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:22,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 55 transitions. [2025-01-09 13:14:22,019 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 55 transitions. Word has length 66 [2025-01-09 13:14:22,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:22,019 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 55 transitions. [2025-01-09 13:14:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 13:14:22,020 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 55 transitions. [2025-01-09 13:14:22,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:22,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:22,021 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:22,034 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:14:22,222 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:14:22,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:22,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -88086291, now seen corresponding path program 1 times [2025-01-09 13:14:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:14:22,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303411880] [2025-01-09 13:14:22,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:22,224 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:14:22,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:14:22,227 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:14:22,230 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:14:22,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:22,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:22,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:22,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:22,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 13:14:22,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:14:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-01-09 13:14:22,581 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:14:22,581 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 13:14:22,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303411880] [2025-01-09 13:14:22,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303411880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:14:22,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:14:22,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:14:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228369283] [2025-01-09 13:14:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:14:22,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:14:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 13:14:22,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:14:22,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:14:22,583 INFO L87 Difference]: Start difference. First operand 40 states and 55 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:14:25,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:14:28,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 13:14:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:14:28,163 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2025-01-09 13:14:28,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:14:28,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 66 [2025-01-09 13:14:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:14:28,186 INFO L225 Difference]: With dead ends: 90 [2025-01-09 13:14:28,186 INFO L226 Difference]: Without dead ends: 53 [2025-01-09 13:14:28,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:14:28,188 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 15 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:14:28,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-09 13:14:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-01-09 13:14:28,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 45. [2025-01-09 13:14:28,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-09 13:14:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2025-01-09 13:14:28,198 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 66 [2025-01-09 13:14:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:14:28,198 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2025-01-09 13:14:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 13:14:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2025-01-09 13:14:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-01-09 13:14:28,204 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:14:28,205 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:28,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:14:28,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 13:14:28,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:14:28,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:14:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash -768144661, now seen corresponding path program 1 times [2025-01-09 13:14:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 13:14:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379079547] [2025-01-09 13:14:28,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:14:28,408 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:14:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 13:14:28,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 13:14:28,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 13:14:28,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 13:14:28,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 13:14:28,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:14:28,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:14:28,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 13:14:28,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:15:07,707 WARN L286 SmtUtils]: Spent 14.72s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 13:15:17,382 WARN L286 SmtUtils]: Spent 5.43s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:15:23,687 WARN L286 SmtUtils]: Spent 6.30s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 13:15:51,846 WARN L286 SmtUtils]: Spent 9.00s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)