./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/for_bounded_loop1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/for_bounded_loop1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:37:01,264 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:37:01,314 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:37:01,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:37:01,317 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:37:01,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:37:01,338 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:37:01,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:37:01,339 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:37:01,339 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:37:01,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:37:01,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:37:01,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:37:01,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:37:01,340 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:37:01,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:37:01,341 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:37:01,342 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:37:01,342 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:37:01,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:37:01,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:37:01,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/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 -> d362508cc6d10100af1abe34073a764b50319c9e1ae9c7cc9c70a242e3f5c8c4 [2025-03-08 04:37:01,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:37:01,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:37:01,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:37:01,565 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:37:01,565 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:37:01,566 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/for_bounded_loop1.c [2025-03-08 04:37:02,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774a23fed/bd231094a89d4401b1385db993a01a01/FLAGd2a40dd0c [2025-03-08 04:37:02,885 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:37:02,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c [2025-03-08 04:37:02,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774a23fed/bd231094a89d4401b1385db993a01a01/FLAGd2a40dd0c [2025-03-08 04:37:03,259 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/774a23fed/bd231094a89d4401b1385db993a01a01 [2025-03-08 04:37:03,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:37:03,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:37:03,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:37:03,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:37:03,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:37:03,266 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,267 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cab09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03, skipping insertion in model container [2025-03-08 04:37:03,267 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:37:03,370 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c[416,429] [2025-03-08 04:37:03,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:37:03,385 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:37:03,392 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/for_bounded_loop1.c[416,429] [2025-03-08 04:37:03,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:37:03,403 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:37:03,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03 WrapperNode [2025-03-08 04:37:03,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:37:03,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:37:03,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:37:03,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:37:03,409 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,422 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2025-03-08 04:37:03,422 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:37:03,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:37:03,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:37:03,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:37:03,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,432 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-03-08 04:37:03,432 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,434 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:37:03,436 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:37:03,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:37:03,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:37:03,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (1/1) ... [2025-03-08 04:37:03,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:37:03,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:37:03,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:37:03,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:37:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:37:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:37:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:37:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:37:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-08 04:37:03,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-08 04:37:03,506 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:37:03,507 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:37:03,601 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-08 04:37:03,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:37:03,609 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:37:03,609 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:37:03,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:37:03 BoogieIcfgContainer [2025-03-08 04:37:03,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:37:03,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:37:03,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:37:03,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:37:03,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:37:03" (1/3) ... [2025-03-08 04:37:03,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1565db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:37:03, skipping insertion in model container [2025-03-08 04:37:03,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:37:03" (2/3) ... [2025-03-08 04:37:03,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1565db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:37:03, skipping insertion in model container [2025-03-08 04:37:03,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:37:03" (3/3) ... [2025-03-08 04:37:03,619 INFO L128 eAbstractionObserver]: Analyzing ICFG for_bounded_loop1.c [2025-03-08 04:37:03,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:37:03,631 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG for_bounded_loop1.c that has 2 procedures, 19 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 04:37:03,667 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:37:03,679 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;@55c55d66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:37:03,680 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:37:03,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:37:03,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 04:37:03,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:03,687 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:03,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:03,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:03,690 INFO L85 PathProgramCache]: Analyzing trace with hash 534170483, now seen corresponding path program 1 times [2025-03-08 04:37:03,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:03,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273722984] [2025-03-08 04:37:03,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:37:03,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:03,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 04:37:03,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 04:37:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:37:03,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273722984] [2025-03-08 04:37:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273722984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:37:03,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:37:03,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 04:37:03,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033914961] [2025-03-08 04:37:03,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:37:03,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:37:03,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:03,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:37:03,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 04:37:03,936 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:04,000 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-03-08 04:37:04,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 04:37:04,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-08 04:37:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:04,006 INFO L225 Difference]: With dead ends: 46 [2025-03-08 04:37:04,006 INFO L226 Difference]: Without dead ends: 24 [2025-03-08 04:37:04,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-08 04:37:04,010 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:04,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 63 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:37:04,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-08 04:37:04,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-08 04:37:04,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:37:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-08 04:37:04,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 8 [2025-03-08 04:37:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:04,032 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-08 04:37:04,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 04:37:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-08 04:37:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 04:37:04,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:04,032 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:37:04,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1668255516, now seen corresponding path program 1 times [2025-03-08 04:37:04,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438921117] [2025-03-08 04:37:04,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:37:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:04,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 04:37:04,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 04:37:04,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:04,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:04,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:37:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438921117] [2025-03-08 04:37:04,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438921117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:37:04,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:37:04,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 04:37:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483503682] [2025-03-08 04:37:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:37:04,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 04:37:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:04,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 04:37:04,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 04:37:04,235 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:37:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:04,313 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-03-08 04:37:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:37:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2025-03-08 04:37:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:04,314 INFO L225 Difference]: With dead ends: 34 [2025-03-08 04:37:04,314 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 04:37:04,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:37:04,317 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:04,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 67 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:37:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 04:37:04,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-08 04:37:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 04:37:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2025-03-08 04:37:04,322 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 15 [2025-03-08 04:37:04,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:04,322 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2025-03-08 04:37:04,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 04:37:04,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2025-03-08 04:37:04,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:37:04,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:04,322 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:04,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 04:37:04,324 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:04,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:04,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1804286279, now seen corresponding path program 1 times [2025-03-08 04:37:04,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:04,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187211236] [2025-03-08 04:37:04,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:37:04,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:04,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:37:04,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:37:04,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:04,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:37:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:37:04,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187211236] [2025-03-08 04:37:04,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187211236] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:37:04,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057153265] [2025-03-08 04:37:04,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:37:04,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:04,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:37:04,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:37:04,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:37:04,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:37:04,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:37:04,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:04,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:37:04,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 04:37:04,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:37:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:37:04,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:37:04,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 04:37:04,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057153265] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 04:37:04,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:37:04,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 7] total 9 [2025-03-08 04:37:04,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254587497] [2025-03-08 04:37:04,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:37:04,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 04:37:04,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:37:04,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 04:37:04,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 04:37:04,639 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:37:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:37:04,671 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2025-03-08 04:37:04,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 04:37:04,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-08 04:37:04,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:37:04,675 INFO L225 Difference]: With dead ends: 35 [2025-03-08 04:37:04,676 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 04:37:04,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-08 04:37:04,677 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:37:04,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:37:04,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 04:37:04,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-08 04:37:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 25 states have internal predecessors, (25), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 04:37:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-08 04:37:04,686 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 22 [2025-03-08 04:37:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:37:04,686 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-08 04:37:04,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 04:37:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-08 04:37:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 04:37:04,687 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:37:04,687 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:37:04,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:37:04,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:37:04,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:37:04,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:37:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1803481922, now seen corresponding path program 1 times [2025-03-08 04:37:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:37:04,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380848739] [2025-03-08 04:37:04,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:37:04,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:37:04,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:37:04,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:37:04,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:04,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:37:04,897 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 04:37:04,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 04:37:04,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 04:37:04,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:37:04,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 04:37:04,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 04:37:04,916 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 04:37:04,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 04:37:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 04:37:04,920 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 04:37:04,934 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 04:37:04,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 04:37:04 BoogieIcfgContainer [2025-03-08 04:37:04,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 04:37:04,936 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 04:37:04,936 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 04:37:04,936 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 04:37:04,937 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:37:03" (3/4) ... [2025-03-08 04:37:04,937 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-08 04:37:04,967 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 13. [2025-03-08 04:37:05,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 04:37:05,006 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 04:37:05,006 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 04:37:05,007 INFO L158 Benchmark]: Toolchain (without parser) took 1745.13ms. Allocated memory is still 201.3MB. Free memory was 153.2MB in the beginning and 137.4MB in the end (delta: 15.8MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2025-03-08 04:37:05,008 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 192.9MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:37:05,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.04ms. Allocated memory is still 201.3MB. Free memory was 152.9MB in the beginning and 142.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:37:05,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.67ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 141.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:37:05,010 INFO L158 Benchmark]: Boogie Preprocessor took 12.97ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:37:05,010 INFO L158 Benchmark]: IcfgBuilder took 174.07ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 129.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 04:37:05,010 INFO L158 Benchmark]: TraceAbstraction took 1323.72ms. Allocated memory is still 201.3MB. Free memory was 128.4MB in the beginning and 144.3MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:37:05,011 INFO L158 Benchmark]: Witness Printer took 70.31ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 137.4MB in the end (delta: 6.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 04:37:05,012 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.14ms. Allocated memory is still 192.9MB. Free memory is still 110.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.04ms. Allocated memory is still 201.3MB. Free memory was 152.9MB in the beginning and 142.0MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.67ms. Allocated memory is still 201.3MB. Free memory was 142.0MB in the beginning and 141.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.97ms. Allocated memory is still 201.3MB. Free memory was 141.0MB in the beginning and 139.9MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 174.07ms. Allocated memory is still 201.3MB. Free memory was 139.9MB in the beginning and 129.1MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1323.72ms. Allocated memory is still 201.3MB. Free memory was 128.4MB in the beginning and 144.3MB in the end (delta: -15.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.31ms. Allocated memory is still 201.3MB. Free memory was 144.3MB in the beginning and 137.4MB in the end (delta: 6.9MB). 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 - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int i=0, x=0, y=0; [L20] int n=__VERIFIER_nondet_int(); [L21] COND FALSE !(!(n>0)) [L22] i=0 VAL [i=0, n=1, x=0, y=0] [L22] COND TRUE i