./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label14.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/eca-rers2012/Problem10_label14.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 44291f101ed3e7fb4c7970a4074f60b073a885b55c43de2ec3cb5a39e62e8317 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:40:01,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:40:02,028 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:40:02,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:40:02,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:40:02,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:40:02,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:40:02,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:40:02,057 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:40:02,057 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:40:02,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:40:02,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:40:02,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:40:02,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:40:02,059 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:02,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:40:02,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:40:02,060 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 -> 44291f101ed3e7fb4c7970a4074f60b073a885b55c43de2ec3cb5a39e62e8317 [2025-03-08 01:40:02,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:40:02,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:40:02,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:40:02,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:40:02,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:40:02,274 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label14.c [2025-03-08 01:40:03,417 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348fc91d2/e153a15c862c46f1a6462c97f740f33b/FLAGa56051098 [2025-03-08 01:40:03,689 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:40:03,694 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label14.c [2025-03-08 01:40:03,712 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348fc91d2/e153a15c862c46f1a6462c97f740f33b/FLAGa56051098 [2025-03-08 01:40:03,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/348fc91d2/e153a15c862c46f1a6462c97f740f33b [2025-03-08 01:40:03,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:40:03,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:40:03,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:03,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:40:03,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:40:03,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:03" (1/1) ... [2025-03-08 01:40:03,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0f3a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:03, skipping insertion in model container [2025-03-08 01:40:03,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:40:03" (1/1) ... [2025-03-08 01:40:04,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:40:04,155 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/eca-rers2012/Problem10_label14.c[3703,3716] [2025-03-08 01:40:04,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:04,274 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:40:04,288 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/eca-rers2012/Problem10_label14.c[3703,3716] [2025-03-08 01:40:04,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:40:04,376 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:40:04,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04 WrapperNode [2025-03-08 01:40:04,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:40:04,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:04,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:40:04,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:40:04,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,400 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,455 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-08 01:40:04,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:40:04,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:40:04,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:40:04,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:40:04,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,496 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 01:40:04,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,519 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,528 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,530 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:40:04,537 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:40:04,537 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:40:04,537 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:40:04,538 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (1/1) ... [2025-03-08 01:40:04,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:40:04,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:04,563 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 01:40:04,569 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 01:40:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:40:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:40:04,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:40:04,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:40:04,643 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:40:04,644 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:40:05,557 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-08 01:40:05,557 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:40:05,570 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:40:05,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:40:05,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:05 BoogieIcfgContainer [2025-03-08 01:40:05,573 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:40:05,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:40:05,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:40:05,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:40:05,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:40:03" (1/3) ... [2025-03-08 01:40:05,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48033f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:05, skipping insertion in model container [2025-03-08 01:40:05,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:40:04" (2/3) ... [2025-03-08 01:40:05,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48033f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:40:05, skipping insertion in model container [2025-03-08 01:40:05,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:05" (3/3) ... [2025-03-08 01:40:05,581 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label14.c [2025-03-08 01:40:05,596 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:40:05,597 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label14.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:40:05,651 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:40:05,665 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;@567e3b33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:40:05,665 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:40:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:05,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 01:40:05,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:05,676 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:05,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:05,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:05,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1730594535, now seen corresponding path program 1 times [2025-03-08 01:40:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:05,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440872319] [2025-03-08 01:40:05,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:05,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:05,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 01:40:05,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 01:40:05,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:05,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:05,939 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 01:40:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:05,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440872319] [2025-03-08 01:40:05,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440872319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:05,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:05,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:40:05,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185708141] [2025-03-08 01:40:05,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:05,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:05,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:05,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:05,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:05,960 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6813725490196079) internal successors, (343), 205 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:06,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:06,626 INFO L93 Difference]: Finished difference Result 567 states and 978 transitions. [2025-03-08 01:40:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:06,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-08 01:40:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:06,634 INFO L225 Difference]: With dead ends: 567 [2025-03-08 01:40:06,636 INFO L226 Difference]: Without dead ends: 282 [2025-03-08 01:40:06,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 01:40:06,642 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:06,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 66 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:40:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-08 01:40:06,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2025-03-08 01:40:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.4661921708185053) internal successors, (412), 281 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2025-03-08 01:40:06,687 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 31 [2025-03-08 01:40:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:06,688 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2025-03-08 01:40:06,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:06,688 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2025-03-08 01:40:06,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 01:40:06,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:06,690 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:06,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:40:06,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash -107929976, now seen corresponding path program 1 times [2025-03-08 01:40:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:06,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252327614] [2025-03-08 01:40:06,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:06,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 01:40:06,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 01:40:06,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:06,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:06,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252327614] [2025-03-08 01:40:06,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252327614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:06,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:06,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:40:06,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593387501] [2025-03-08 01:40:06,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:06,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:06,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:06,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:06,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:06,891 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:07,305 INFO L93 Difference]: Finished difference Result 840 states and 1231 transitions. [2025-03-08 01:40:07,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:07,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2025-03-08 01:40:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:07,311 INFO L225 Difference]: With dead ends: 840 [2025-03-08 01:40:07,311 INFO L226 Difference]: Without dead ends: 560 [2025-03-08 01:40:07,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-03-08 01:40:07,316 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:07,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2025-03-08 01:40:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2025-03-08 01:40:07,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3059033989266546) internal successors, (730), 559 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:07,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 730 transitions. [2025-03-08 01:40:07,349 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 730 transitions. Word has length 101 [2025-03-08 01:40:07,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:07,350 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 730 transitions. [2025-03-08 01:40:07,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 730 transitions. [2025-03-08 01:40:07,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-08 01:40:07,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:07,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:07,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:40:07,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:07,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:07,353 INFO L85 PathProgramCache]: Analyzing trace with hash 52426291, now seen corresponding path program 1 times [2025-03-08 01:40:07,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:07,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48353088] [2025-03-08 01:40:07,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:07,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:07,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 01:40:07,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 01:40:07,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:07,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:07,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48353088] [2025-03-08 01:40:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48353088] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:40:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800357765] [2025-03-08 01:40:07,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:07,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:40:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:40:07,638 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 01:40:07,639 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 01:40:07,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 01:40:07,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 01:40:07,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:07,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:07,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 01:40:07,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:40:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:07,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:40:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800357765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:40:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 01:40:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159707868] [2025-03-08 01:40:07,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:07,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:07,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:07,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:40:07,752 INFO L87 Difference]: Start difference. First operand 560 states and 730 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:08,147 INFO L93 Difference]: Finished difference Result 979 states and 1299 transitions. [2025-03-08 01:40:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:08,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2025-03-08 01:40:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:08,156 INFO L225 Difference]: With dead ends: 979 [2025-03-08 01:40:08,156 INFO L226 Difference]: Without dead ends: 977 [2025-03-08 01:40:08,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 01:40:08,158 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 153 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:08,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-03-08 01:40:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2025-03-08 01:40:08,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 1.3524355300859598) internal successors, (944), 698 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:08,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 944 transitions. [2025-03-08 01:40:08,182 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 944 transitions. Word has length 106 [2025-03-08 01:40:08,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:08,183 INFO L471 AbstractCegarLoop]: Abstraction has 699 states and 944 transitions. [2025-03-08 01:40:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 944 transitions. [2025-03-08 01:40:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 01:40:08,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:08,200 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:08,210 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 01:40:08,403 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 01:40:08,404 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 833111808, now seen corresponding path program 1 times [2025-03-08 01:40:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861365475] [2025-03-08 01:40:08,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:08,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 01:40:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 01:40:08,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:08,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:08,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861365475] [2025-03-08 01:40:08,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861365475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:08,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:08,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537894166] [2025-03-08 01:40:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:40:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:08,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:40:08,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:40:08,766 INFO L87 Difference]: Start difference. First operand 699 states and 944 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:09,250 INFO L93 Difference]: Finished difference Result 1535 states and 2045 transitions. [2025-03-08 01:40:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:40:09,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2025-03-08 01:40:09,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:09,254 INFO L225 Difference]: With dead ends: 1535 [2025-03-08 01:40:09,254 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 01:40:09,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:40:09,255 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:09,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 01:40:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-08 01:40:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2998805256869772) internal successors, (1088), 837 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1088 transitions. [2025-03-08 01:40:09,268 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1088 transitions. Word has length 149 [2025-03-08 01:40:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:09,268 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1088 transitions. [2025-03-08 01:40:09,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1088 transitions. [2025-03-08 01:40:09,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 01:40:09,270 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:09,270 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:09,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:40:09,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:09,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2104103478, now seen corresponding path program 1 times [2025-03-08 01:40:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:09,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375574546] [2025-03-08 01:40:09,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:09,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:09,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 01:40:09,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 01:40:09,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:09,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:09,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:09,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375574546] [2025-03-08 01:40:09,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375574546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:09,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:09,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 01:40:09,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341834232] [2025-03-08 01:40:09,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:09,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 01:40:09,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:09,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 01:40:09,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:40:09,634 INFO L87 Difference]: Start difference. First operand 838 states and 1088 transitions. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:10,098 INFO L93 Difference]: Finished difference Result 1590 states and 2085 transitions. [2025-03-08 01:40:10,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 01:40:10,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2025-03-08 01:40:10,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:10,101 INFO L225 Difference]: With dead ends: 1590 [2025-03-08 01:40:10,101 INFO L226 Difference]: Without dead ends: 838 [2025-03-08 01:40:10,102 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 01:40:10,103 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:10,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 22 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:10,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-03-08 01:40:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2025-03-08 01:40:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2927120669056154) internal successors, (1082), 837 states have internal predecessors, (1082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1082 transitions. [2025-03-08 01:40:10,118 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1082 transitions. Word has length 184 [2025-03-08 01:40:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:10,118 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1082 transitions. [2025-03-08 01:40:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 6 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1082 transitions. [2025-03-08 01:40:10,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 01:40:10,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:10,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:10,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:40:10,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:10,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:10,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1181246615, now seen corresponding path program 1 times [2025-03-08 01:40:10,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:10,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409112998] [2025-03-08 01:40:10,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:10,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:10,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 01:40:10,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 01:40:10,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:10,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:10,276 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:10,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:10,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409112998] [2025-03-08 01:40:10,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409112998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:10,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:10,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:10,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47311312] [2025-03-08 01:40:10,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:10,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:10,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:10,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:10,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:10,277 INFO L87 Difference]: Start difference. First operand 838 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:10,654 INFO L93 Difference]: Finished difference Result 1952 states and 2639 transitions. [2025-03-08 01:40:10,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:10,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-03-08 01:40:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:10,659 INFO L225 Difference]: With dead ends: 1952 [2025-03-08 01:40:10,659 INFO L226 Difference]: Without dead ends: 1255 [2025-03-08 01:40:10,660 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-03-08 01:40:10,662 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:10,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 214 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-08 01:40:10,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 838. [2025-03-08 01:40:10,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2819593787335724) internal successors, (1073), 837 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1073 transitions. [2025-03-08 01:40:10,678 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1073 transitions. Word has length 191 [2025-03-08 01:40:10,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:10,678 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1073 transitions. [2025-03-08 01:40:10,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1073 transitions. [2025-03-08 01:40:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 01:40:10,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:10,680 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 01:40:10,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:40:10,681 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:10,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:10,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1556221488, now seen corresponding path program 1 times [2025-03-08 01:40:10,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853907669] [2025-03-08 01:40:10,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:10,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:10,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 01:40:10,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 01:40:10,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:10,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:10,831 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:40:10,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:10,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853907669] [2025-03-08 01:40:10,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853907669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:10,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:10,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:10,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908064602] [2025-03-08 01:40:10,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:10,834 INFO L87 Difference]: Start difference. First operand 838 states and 1073 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:11,193 INFO L93 Difference]: Finished difference Result 1952 states and 2621 transitions. [2025-03-08 01:40:11,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-08 01:40:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:11,197 INFO L225 Difference]: With dead ends: 1952 [2025-03-08 01:40:11,197 INFO L226 Difference]: Without dead ends: 1255 [2025-03-08 01:40:11,198 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-03-08 01:40:11,199 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:11,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:40:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-03-08 01:40:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2025-03-08 01:40:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1115 states have (on average 1.2609865470852017) internal successors, (1406), 1115 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1406 transitions. [2025-03-08 01:40:11,217 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1406 transitions. Word has length 220 [2025-03-08 01:40:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:11,217 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1406 transitions. [2025-03-08 01:40:11,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1406 transitions. [2025-03-08 01:40:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-08 01:40:11,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:40:11,221 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:11,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:40:11,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:40:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:40:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 400167030, now seen corresponding path program 1 times [2025-03-08 01:40:11,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:40:11,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888783640] [2025-03-08 01:40:11,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:40:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:40:11,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-08 01:40:11,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-08 01:40:11,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:40:11,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:40:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-08 01:40:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:40:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888783640] [2025-03-08 01:40:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888783640] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:40:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:40:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:40:11,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089865973] [2025-03-08 01:40:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:40:11,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:40:11,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:40:11,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:40:11,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:40:11,529 INFO L87 Difference]: Start difference. First operand 1116 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:40:11,910 INFO L93 Difference]: Finished difference Result 2645 states and 3360 transitions. [2025-03-08 01:40:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:40:11,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-03-08 01:40:11,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:40:11,912 INFO L225 Difference]: With dead ends: 2645 [2025-03-08 01:40:11,912 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:40:11,914 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-03-08 01:40:11,914 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:40:11,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 53 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 01:40:11,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:40:11,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:40:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:40:11,915 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 330 [2025-03-08 01:40:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:40:11,915 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:40:11,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:40:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:40:11,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:40:11,920 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:40:11,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:40:11,923 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:40:11,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:40:12,037 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 01:40:12,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 01:40:12 BoogieIcfgContainer [2025-03-08 01:40:12,051 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 01:40:12,052 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 01:40:12,052 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 01:40:12,052 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 01:40:12,053 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:40:05" (3/4) ... [2025-03-08 01:40:12,054 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 01:40:12,063 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 01:40:12,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 01:40:12,064 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 01:40:12,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 01:40:12,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 01:40:12,160 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 01:40:12,160 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 01:40:12,161 INFO L158 Benchmark]: Toolchain (without parser) took 8175.83ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 103.1MB in the beginning and 78.5MB in the end (delta: 24.6MB). Peak memory consumption was 100.9MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,161 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 192.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 01:40:12,161 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.48ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 76.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,161 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.38ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 68.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,161 INFO L158 Benchmark]: Boogie Preprocessor took 80.59ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 60.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,161 INFO L158 Benchmark]: IcfgBuilder took 1036.63ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 97.3MB in the end (delta: -37.3MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,162 INFO L158 Benchmark]: TraceAbstraction took 6476.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 96.4MB in the beginning and 91.6MB in the end (delta: 4.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,162 INFO L158 Benchmark]: Witness Printer took 108.15ms. Allocated memory is still 218.1MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 01:40:12,163 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.24ms. Allocated memory is still 192.9MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.48ms. Allocated memory is still 142.6MB. Free memory was 103.1MB in the beginning and 76.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.38ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 68.8MB in the end (delta: 7.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.59ms. Allocated memory is still 142.6MB. Free memory was 68.8MB in the beginning and 60.0MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1036.63ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 97.3MB in the end (delta: -37.3MB). Peak memory consumption was 44.9MB. Max. memory is 16.1GB. * TraceAbstraction took 6476.01ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 96.4MB in the beginning and 91.6MB in the end (delta: 4.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 108.15ms. Allocated memory is still 218.1MB. Free memory was 91.6MB in the beginning and 78.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. 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 - PositiveResult [Line: 107]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 343 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 8, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 842 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 498 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3539 IncrementalHoareTripleChecker+Invalid, 4037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 498 mSolverCounterUnsat, 660 mSDtfsCounter, 3539 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=7, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 834 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1418 NumberOfCodeBlocks, 1418 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1409 ConstructedInterpolants, 0 QuantifiedInterpolants, 5347 SizeOfPredicates, 0 NumberOfNonLiveVariables, 186 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 830/840 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Location Invariant Derived location invariant: ((((((8 <= a19) && (14 == a4)) && (a12 == 0)) || (((14 == a4) && (a12 == 0)) && (a1 <= 33))) || (((14 == a4) && (a10 == 2)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-08 01:40:12,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing output log to file Ultimate.log Result: TRUE