./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label09.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/Problem16_label09.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 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:03:37,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:03:37,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:03:37,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:03:37,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:03:37,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:03:37,314 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:03:37,314 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:03:37,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:03:37,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:03:37,315 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:03:37,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:03:37,315 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:03:37,317 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:03:37,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:37,318 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:03:37,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:03:37,318 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 -> 94406c90b46fed2ba639405486e012fa4ad77124178cc3ef79a472c538020bbf [2025-03-08 02:03:37,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:03:37,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:03:37,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:03:37,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:03:37,552 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:03:37,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2025-03-08 02:03:38,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08126a3be/3b2f4eb872454e80b5b37da9f04711aa/FLAGb6c1f2ea5 [2025-03-08 02:03:39,020 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:03:39,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label09.c [2025-03-08 02:03:39,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08126a3be/3b2f4eb872454e80b5b37da9f04711aa/FLAGb6c1f2ea5 [2025-03-08 02:03:39,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08126a3be/3b2f4eb872454e80b5b37da9f04711aa [2025-03-08 02:03:39,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:03:39,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:03:39,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:39,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:03:39,063 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:03:39,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,066 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a868a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39, skipping insertion in model container [2025-03-08 02:03:39,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:03:39,228 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/Problem16_label09.c[5013,5026] [2025-03-08 02:03:39,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:39,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:03:39,460 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/Problem16_label09.c[5013,5026] [2025-03-08 02:03:39,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:03:39,562 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:03:39,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39 WrapperNode [2025-03-08 02:03:39,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:03:39,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:39,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:03:39,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:03:39,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,588 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,689 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:03:39,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:03:39,690 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:03:39,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:03:39,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:03:39,696 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,753 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 02:03:39,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,796 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,816 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:03:39,829 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:03:39,829 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:03:39,829 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:03:39,830 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (1/1) ... [2025-03-08 02:03:39,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:03:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:39,857 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 02:03:39,860 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 02:03:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:03:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:03:39,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:03:39,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:03:39,931 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:03:39,932 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:03:41,532 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:03:41,606 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:03:41,606 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:03:41,628 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:03:41,629 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:03:41,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:41 BoogieIcfgContainer [2025-03-08 02:03:41,630 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:03:41,632 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:03:41,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:03:41,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:03:41,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:03:39" (1/3) ... [2025-03-08 02:03:41,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40368142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:41, skipping insertion in model container [2025-03-08 02:03:41,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:03:39" (2/3) ... [2025-03-08 02:03:41,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40368142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:03:41, skipping insertion in model container [2025-03-08 02:03:41,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:41" (3/3) ... [2025-03-08 02:03:41,639 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label09.c [2025-03-08 02:03:41,651 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:03:41,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label09.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:03:41,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:03:41,714 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;@2cf6c72c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:03:41,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:03:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 02:03:41,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-08 02:03:41,723 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:41,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:41,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:41,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash -691344195, now seen corresponding path program 1 times [2025-03-08 02:03:41,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:41,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343387542] [2025-03-08 02:03:41,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:41,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-08 02:03:41,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-08 02:03:41,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:41,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:42,011 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 02:03:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:42,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343387542] [2025-03-08 02:03:42,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343387542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:42,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:42,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:42,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97406744] [2025-03-08 02:03:42,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:42,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:42,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:42,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:42,034 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 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 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 02:03:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:43,340 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:03:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:43,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2025-03-08 02:03:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:43,359 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:03:43,359 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:03:43,363 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 02:03:43,368 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 340 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:43,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:03:43,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:03:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:03:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 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 02:03:43,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-03-08 02:03:43,432 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 47 [2025-03-08 02:03:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-03-08 02:03:43,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 02:03:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-03-08 02:03:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-08 02:03:43,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:43,436 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, 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] [2025-03-08 02:03:43,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:03:43,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:43,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:43,437 INFO L85 PathProgramCache]: Analyzing trace with hash 776957296, now seen corresponding path program 1 times [2025-03-08 02:03:43,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:43,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421011829] [2025-03-08 02:03:43,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:43,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:43,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-08 02:03:43,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-08 02:03:43,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:43,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421011829] [2025-03-08 02:03:43,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421011829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:43,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:43,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813348549] [2025-03-08 02:03:43,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:43,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:03:43,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:43,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:03:43,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:03:43,733 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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 02:03:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:45,237 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-03-08 02:03:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:03:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2025-03-08 02:03:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:45,243 INFO L225 Difference]: With dead ends: 2309 [2025-03-08 02:03:45,243 INFO L226 Difference]: Without dead ends: 1649 [2025-03-08 02:03:45,244 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 02:03:45,245 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1008 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:45,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:03:45,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-08 02:03:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-08 02:03:45,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4016990291262137) internal successors, (2310), 1648 states have internal predecessors, (2310), 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 02:03:45,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2310 transitions. [2025-03-08 02:03:45,277 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2310 transitions. Word has length 115 [2025-03-08 02:03:45,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:45,277 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2310 transitions. [2025-03-08 02:03:45,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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 02:03:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2310 transitions. [2025-03-08 02:03:45,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-08 02:03:45,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:45,279 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, 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] [2025-03-08 02:03:45,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:03:45,279 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:45,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:45,279 INFO L85 PathProgramCache]: Analyzing trace with hash 587113456, now seen corresponding path program 1 times [2025-03-08 02:03:45,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:45,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983430090] [2025-03-08 02:03:45,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:45,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:45,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 02:03:45,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 02:03:45,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:45,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:45,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:45,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983430090] [2025-03-08 02:03:45,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983430090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:45,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:45,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:45,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738815957] [2025-03-08 02:03:45,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:45,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:45,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:45,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:45,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:45,475 INFO L87 Difference]: Start difference. First operand 1649 states and 2310 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 02:03:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:46,502 INFO L93 Difference]: Finished difference Result 3625 states and 5242 transitions. [2025-03-08 02:03:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:46,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 178 [2025-03-08 02:03:46,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:46,510 INFO L225 Difference]: With dead ends: 3625 [2025-03-08 02:03:46,510 INFO L226 Difference]: Without dead ends: 2307 [2025-03-08 02:03:46,512 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 02:03:46,512 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:46,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:03:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-08 02:03:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-08 02:03:46,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.349956634865568) internal successors, (3113), 2306 states have internal predecessors, (3113), 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 02:03:46,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3113 transitions. [2025-03-08 02:03:46,546 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3113 transitions. Word has length 178 [2025-03-08 02:03:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3113 transitions. [2025-03-08 02:03:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 2 states have internal predecessors, (178), 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 02:03:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3113 transitions. [2025-03-08 02:03:46,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 02:03:46,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:46,548 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:03:46,548 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:46,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:46,549 INFO L85 PathProgramCache]: Analyzing trace with hash 92894857, now seen corresponding path program 1 times [2025-03-08 02:03:46,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526533410] [2025-03-08 02:03:46,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:46,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 02:03:46,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 02:03:46,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:46,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:46,736 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:03:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526533410] [2025-03-08 02:03:46,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526533410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:46,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:46,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:03:46,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368321180] [2025-03-08 02:03:46,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:46,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:46,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:46,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:46,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:46,738 INFO L87 Difference]: Start difference. First operand 2307 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 02:03:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:47,634 INFO L93 Difference]: Finished difference Result 5599 states and 7699 transitions. [2025-03-08 02:03:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 213 [2025-03-08 02:03:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:47,647 INFO L225 Difference]: With dead ends: 5599 [2025-03-08 02:03:47,648 INFO L226 Difference]: Without dead ends: 3623 [2025-03-08 02:03:47,650 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 02:03:47,652 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:47,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:03:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-08 02:03:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 2965. [2025-03-08 02:03:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.2442645074224021) internal successors, (3688), 2964 states have internal predecessors, (3688), 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 02:03:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3688 transitions. [2025-03-08 02:03:47,696 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3688 transitions. Word has length 213 [2025-03-08 02:03:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:47,697 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3688 transitions. [2025-03-08 02:03:47,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 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 02:03:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3688 transitions. [2025-03-08 02:03:47,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 02:03:47,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:47,699 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:47,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:03:47,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:47,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:47,700 INFO L85 PathProgramCache]: Analyzing trace with hash 985373243, now seen corresponding path program 1 times [2025-03-08 02:03:47,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:47,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892527370] [2025-03-08 02:03:47,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:47,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:47,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 02:03:47,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 02:03:47,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:47,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892527370] [2025-03-08 02:03:47,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892527370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:47,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:47,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90086559] [2025-03-08 02:03:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:47,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:47,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:47,842 INFO L87 Difference]: Start difference. First operand 2965 states and 3688 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 02:03:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:48,706 INFO L93 Difference]: Finished difference Result 6915 states and 8657 transitions. [2025-03-08 02:03:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 230 [2025-03-08 02:03:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:48,718 INFO L225 Difference]: With dead ends: 6915 [2025-03-08 02:03:48,718 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:03:48,722 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 02:03:48,723 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:48,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 539 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:03:48,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:03:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-03-08 02:03:48,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0736522399392558) internal successors, (4242), 3951 states have internal predecessors, (4242), 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 02:03:48,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4242 transitions. [2025-03-08 02:03:48,789 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4242 transitions. Word has length 230 [2025-03-08 02:03:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:48,789 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4242 transitions. [2025-03-08 02:03:48,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 02:03:48,789 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4242 transitions. [2025-03-08 02:03:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-03-08 02:03:48,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:48,791 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:03:48,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:03:48,791 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:48,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:48,792 INFO L85 PathProgramCache]: Analyzing trace with hash -763104652, now seen corresponding path program 1 times [2025-03-08 02:03:48,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:48,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359144374] [2025-03-08 02:03:48,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:48,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:48,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-03-08 02:03:48,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-03-08 02:03:48,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:48,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:48,988 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:03:48,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:48,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359144374] [2025-03-08 02:03:48,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359144374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:48,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:48,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:48,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508247604] [2025-03-08 02:03:48,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:48,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:48,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:48,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:48,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:48,989 INFO L87 Difference]: Start difference. First operand 3952 states and 4242 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 02:03:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:49,650 INFO L93 Difference]: Finished difference Result 9218 states and 9926 transitions. [2025-03-08 02:03:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 282 [2025-03-08 02:03:49,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:49,661 INFO L225 Difference]: With dead ends: 9218 [2025-03-08 02:03:49,661 INFO L226 Difference]: Without dead ends: 5268 [2025-03-08 02:03:49,665 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 02:03:49,666 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 290 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:49,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 424 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-08 02:03:49,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-08 02:03:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0493639643060566) internal successors, (5527), 5267 states have internal predecessors, (5527), 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 02:03:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5527 transitions. [2025-03-08 02:03:49,721 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5527 transitions. Word has length 282 [2025-03-08 02:03:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5527 transitions. [2025-03-08 02:03:49,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 02:03:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5527 transitions. [2025-03-08 02:03:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2025-03-08 02:03:49,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:49,725 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:03:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:03:49,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:49,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:49,725 INFO L85 PathProgramCache]: Analyzing trace with hash -54661119, now seen corresponding path program 1 times [2025-03-08 02:03:49,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:49,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688849274] [2025-03-08 02:03:49,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:49,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-08 02:03:49,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-08 02:03:49,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:49,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:50,183 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-08 02:03:50,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688849274] [2025-03-08 02:03:50,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688849274] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:03:50,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261856732] [2025-03-08 02:03:50,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:50,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:50,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:50,186 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 02:03:50,187 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 02:03:50,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 386 statements into 1 equivalence classes. [2025-03-08 02:03:50,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 386 of 386 statements. [2025-03-08 02:03:50,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:50,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:50,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:03:50,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:03:50,746 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-08 02:03:50,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:03:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261856732] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:50,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:03:50,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-03-08 02:03:50,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296747980] [2025-03-08 02:03:50,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:50,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:50,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:50,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:50,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:03:50,749 INFO L87 Difference]: Start difference. First operand 5268 states and 5527 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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 02:03:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:51,404 INFO L93 Difference]: Finished difference Result 6257 states and 6540 transitions. [2025-03-08 02:03:51,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:51,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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 386 [2025-03-08 02:03:51,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:51,416 INFO L225 Difference]: With dead ends: 6257 [2025-03-08 02:03:51,416 INFO L226 Difference]: Without dead ends: 6255 [2025-03-08 02:03:51,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:03:51,418 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:51,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 79 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-03-08 02:03:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 5597. [2025-03-08 02:03:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0487848463187992) internal successors, (5869), 5596 states have internal predecessors, (5869), 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 02:03:51,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5869 transitions. [2025-03-08 02:03:51,476 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5869 transitions. Word has length 386 [2025-03-08 02:03:51,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:51,477 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5869 transitions. [2025-03-08 02:03:51,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 2 states have internal predecessors, (248), 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 02:03:51,477 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5869 transitions. [2025-03-08 02:03:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-08 02:03:51,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:51,484 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 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 02:03:51,491 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 02:03:51,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:51,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:51,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:51,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1114061118, now seen corresponding path program 1 times [2025-03-08 02:03:51,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:51,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149609917] [2025-03-08 02:03:51,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:51,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:51,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-08 02:03:51,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-08 02:03:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:52,133 INFO L134 CoverageAnalysis]: Checked inductivity of 811 backedges. 671 proven. 0 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-08 02:03:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149609917] [2025-03-08 02:03:52,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149609917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:52,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047608715] [2025-03-08 02:03:52,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:52,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:52,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:52,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:52,135 INFO L87 Difference]: Start difference. First operand 5597 states and 5869 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 02:03:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:52,850 INFO L93 Difference]: Finished difference Result 12837 states and 13521 transitions. [2025-03-08 02:03:52,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:52,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 622 [2025-03-08 02:03:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:52,875 INFO L225 Difference]: With dead ends: 12837 [2025-03-08 02:03:52,875 INFO L226 Difference]: Without dead ends: 7571 [2025-03-08 02:03:52,880 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 02:03:52,881 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 223 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:52,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 37 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:03:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7571 states. [2025-03-08 02:03:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7571 to 7242. [2025-03-08 02:03:52,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7242 states, 7241 states have (on average 1.0519265294848779) internal successors, (7617), 7241 states have internal predecessors, (7617), 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 02:03:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7617 transitions. [2025-03-08 02:03:52,958 INFO L78 Accepts]: Start accepts. Automaton has 7242 states and 7617 transitions. Word has length 622 [2025-03-08 02:03:52,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:52,958 INFO L471 AbstractCegarLoop]: Abstraction has 7242 states and 7617 transitions. [2025-03-08 02:03:52,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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 02:03:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 7242 states and 7617 transitions. [2025-03-08 02:03:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 712 [2025-03-08 02:03:52,971 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:52,972 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2025-03-08 02:03:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:03:52,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:52,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -962047147, now seen corresponding path program 1 times [2025-03-08 02:03:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:52,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110885457] [2025-03-08 02:03:52,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:52,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:53,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 711 statements into 1 equivalence classes. [2025-03-08 02:03:53,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 711 of 711 statements. [2025-03-08 02:03:53,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:53,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 371 trivial. 0 not checked. [2025-03-08 02:03:53,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:53,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110885457] [2025-03-08 02:03:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110885457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:53,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:53,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:53,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686643412] [2025-03-08 02:03:53,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:53,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:53,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:53,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:53,386 INFO L87 Difference]: Start difference. First operand 7242 states and 7617 transitions. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 02:03:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:53,987 INFO L93 Difference]: Finished difference Result 16127 states and 17017 transitions. [2025-03-08 02:03:53,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:53,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 711 [2025-03-08 02:03:53,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:54,000 INFO L225 Difference]: With dead ends: 16127 [2025-03-08 02:03:54,000 INFO L226 Difference]: Without dead ends: 8887 [2025-03-08 02:03:54,006 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 02:03:54,006 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:54,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 435 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:03:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-08 02:03:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8558. [2025-03-08 02:03:54,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0468622180670797) internal successors, (8958), 8557 states have internal predecessors, (8958), 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 02:03:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 8958 transitions. [2025-03-08 02:03:54,106 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 8958 transitions. Word has length 711 [2025-03-08 02:03:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 8958 transitions. [2025-03-08 02:03:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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 02:03:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 8958 transitions. [2025-03-08 02:03:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2025-03-08 02:03:54,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:54,112 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-03-08 02:03:54,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:03:54,113 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:54,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1301051115, now seen corresponding path program 1 times [2025-03-08 02:03:54,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:54,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380786280] [2025-03-08 02:03:54,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:54,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:54,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-08 02:03:54,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-08 02:03:54,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:54,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 135 proven. 461 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2025-03-08 02:03:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380786280] [2025-03-08 02:03:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380786280] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:03:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932329345] [2025-03-08 02:03:54,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:54,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:03:54,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:03:54,726 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:03:54,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:03:54,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 712 statements into 1 equivalence classes. [2025-03-08 02:03:54,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 712 of 712 statements. [2025-03-08 02:03:54,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:54,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:54,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 855 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:03:54,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:03:54,951 INFO L134 CoverageAnalysis]: Checked inductivity of 839 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-03-08 02:03:54,951 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:03:54,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932329345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:03:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:03:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102860950] [2025-03-08 02:03:54,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:54,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:54,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:54,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:03:54,952 INFO L87 Difference]: Start difference. First operand 8558 states and 8958 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 02:03:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:55,506 INFO L93 Difference]: Finished difference Result 16785 states and 17583 transitions. [2025-03-08 02:03:55,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:55,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 712 [2025-03-08 02:03:55,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:55,518 INFO L225 Difference]: With dead ends: 16785 [2025-03-08 02:03:55,518 INFO L226 Difference]: Without dead ends: 8558 [2025-03-08 02:03:55,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 716 GetRequests, 712 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:03:55,525 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 320 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:55,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 377 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-08 02:03:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-03-08 02:03:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0407853219586303) internal successors, (8906), 8557 states have internal predecessors, (8906), 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 02:03:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 8906 transitions. [2025-03-08 02:03:55,590 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 8906 transitions. Word has length 712 [2025-03-08 02:03:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:55,591 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 8906 transitions. [2025-03-08 02:03:55,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 02:03:55,591 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 8906 transitions. [2025-03-08 02:03:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1171 [2025-03-08 02:03:55,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:55,603 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:55,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 02:03:55,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 02:03:55,807 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:55,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash -649312001, now seen corresponding path program 1 times [2025-03-08 02:03:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50069577] [2025-03-08 02:03:55,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:55,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:55,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1170 statements into 1 equivalence classes. [2025-03-08 02:03:55,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1170 of 1170 statements. [2025-03-08 02:03:55,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:55,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:56,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2763 backedges. 1907 proven. 0 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2025-03-08 02:03:56,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:56,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50069577] [2025-03-08 02:03:56,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50069577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:56,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:56,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:56,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127260407] [2025-03-08 02:03:56,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:56,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:56,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:56,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:56,430 INFO L87 Difference]: Start difference. First operand 8558 states and 8906 transitions. Second operand has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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 02:03:57,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:57,005 INFO L93 Difference]: Finished difference Result 17114 states and 17809 transitions. [2025-03-08 02:03:57,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:57,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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 1170 [2025-03-08 02:03:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:57,019 INFO L225 Difference]: With dead ends: 17114 [2025-03-08 02:03:57,019 INFO L226 Difference]: Without dead ends: 8887 [2025-03-08 02:03:57,026 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 02:03:57,028 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 194 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:57,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 427 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-08 02:03:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8558. [2025-03-08 02:03:57,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0336566553698727) internal successors, (8845), 8557 states have internal predecessors, (8845), 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 02:03:57,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 8845 transitions. [2025-03-08 02:03:57,102 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 8845 transitions. Word has length 1170 [2025-03-08 02:03:57,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:57,102 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 8845 transitions. [2025-03-08 02:03:57,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.66666666666666) internal successors, (605), 3 states have internal predecessors, (605), 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 02:03:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 8845 transitions. [2025-03-08 02:03:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2025-03-08 02:03:57,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:57,114 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:03:57,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:03:57,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:57,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:57,115 INFO L85 PathProgramCache]: Analyzing trace with hash 2005032641, now seen corresponding path program 1 times [2025-03-08 02:03:57,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:57,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122794767] [2025-03-08 02:03:57,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:57,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:57,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1198 statements into 1 equivalence classes. [2025-03-08 02:03:57,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1198 of 1198 statements. [2025-03-08 02:03:57,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:57,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2871 backedges. 1633 proven. 0 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2025-03-08 02:03:57,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:57,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122794767] [2025-03-08 02:03:57,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122794767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:57,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:57,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:57,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917865093] [2025-03-08 02:03:57,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:57,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:57,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:57,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:57,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:57,908 INFO L87 Difference]: Start difference. First operand 8558 states and 8845 transitions. Second operand has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 02:03:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:58,440 INFO L93 Difference]: Finished difference Result 17772 states and 18359 transitions. [2025-03-08 02:03:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 1198 [2025-03-08 02:03:58,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:58,454 INFO L225 Difference]: With dead ends: 17772 [2025-03-08 02:03:58,454 INFO L226 Difference]: Without dead ends: 9545 [2025-03-08 02:03:58,460 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 02:03:58,461 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:58,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 442 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9545 states. [2025-03-08 02:03:58,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545. [2025-03-08 02:03:58,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9545 states, 9544 states have (on average 1.0309094719195306) internal successors, (9839), 9544 states have internal predecessors, (9839), 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 02:03:58,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 9839 transitions. [2025-03-08 02:03:58,534 INFO L78 Accepts]: Start accepts. Automaton has 9545 states and 9839 transitions. Word has length 1198 [2025-03-08 02:03:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 9545 states and 9839 transitions. [2025-03-08 02:03:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 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 02:03:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 9545 states and 9839 transitions. [2025-03-08 02:03:58,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1217 [2025-03-08 02:03:58,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:58,546 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2025-03-08 02:03:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:03:58,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:58,547 INFO L85 PathProgramCache]: Analyzing trace with hash -153215630, now seen corresponding path program 1 times [2025-03-08 02:03:58,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:58,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518510609] [2025-03-08 02:03:58,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:58,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:58,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1216 statements into 1 equivalence classes. [2025-03-08 02:03:58,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1216 of 1216 statements. [2025-03-08 02:03:58,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:58,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:03:59,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2901 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 2587 trivial. 0 not checked. [2025-03-08 02:03:59,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:03:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518510609] [2025-03-08 02:03:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518510609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:03:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:03:59,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:03:59,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27783971] [2025-03-08 02:03:59,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:03:59,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:03:59,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:03:59,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:03:59,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:03:59,111 INFO L87 Difference]: Start difference. First operand 9545 states and 9839 transitions. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 02:03:59,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:03:59,703 INFO L93 Difference]: Finished difference Result 19746 states and 20341 transitions. [2025-03-08 02:03:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:03:59,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 1216 [2025-03-08 02:03:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:03:59,716 INFO L225 Difference]: With dead ends: 19746 [2025-03-08 02:03:59,716 INFO L226 Difference]: Without dead ends: 8887 [2025-03-08 02:03:59,725 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 02:03:59,725 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 296 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:03:59,725 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 414 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:03:59,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-08 02:03:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-03-08 02:03:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0262210218320955) internal successors, (9119), 8886 states have internal predecessors, (9119), 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 02:03:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9119 transitions. [2025-03-08 02:03:59,827 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9119 transitions. Word has length 1216 [2025-03-08 02:03:59,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:03:59,828 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9119 transitions. [2025-03-08 02:03:59,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 02:03:59,828 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9119 transitions. [2025-03-08 02:03:59,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1359 [2025-03-08 02:03:59,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:03:59,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-03-08 02:03:59,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:03:59,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:03:59,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:03:59,855 INFO L85 PathProgramCache]: Analyzing trace with hash 581568749, now seen corresponding path program 1 times [2025-03-08 02:03:59,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:03:59,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470480514] [2025-03-08 02:03:59,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:03:59,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:03:59,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1358 statements into 1 equivalence classes. [2025-03-08 02:03:59,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1358 of 1358 statements. [2025-03-08 02:03:59,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:03:59,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3802 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 3443 trivial. 0 not checked. [2025-03-08 02:04:00,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:00,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470480514] [2025-03-08 02:04:00,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470480514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:00,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:00,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722222139] [2025-03-08 02:04:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:00,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:00,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:00,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:00,527 INFO L87 Difference]: Start difference. First operand 8887 states and 9119 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 02:04:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:00,843 INFO L93 Difference]: Finished difference Result 9223 states and 9455 transitions. [2025-03-08 02:04:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 1358 [2025-03-08 02:04:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:00,853 INFO L225 Difference]: With dead ends: 9223 [2025-03-08 02:04:00,853 INFO L226 Difference]: Without dead ends: 8887 [2025-03-08 02:04:00,855 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 02:04:00,855 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:00,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 02:04:00,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-03-08 02:04:00,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8887. [2025-03-08 02:04:00,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0261084852577087) internal successors, (9118), 8886 states have internal predecessors, (9118), 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 02:04:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9118 transitions. [2025-03-08 02:04:00,912 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9118 transitions. Word has length 1358 [2025-03-08 02:04:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:00,912 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9118 transitions. [2025-03-08 02:04:00,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 02:04:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9118 transitions. [2025-03-08 02:04:00,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1511 [2025-03-08 02:04:00,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:00,927 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 02:04:00,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:04:00,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:00,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:00,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1464292788, now seen corresponding path program 1 times [2025-03-08 02:04:00,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:00,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671392792] [2025-03-08 02:04:00,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:00,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:00,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1510 statements into 1 equivalence classes. [2025-03-08 02:04:01,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1510 of 1510 statements. [2025-03-08 02:04:01,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:01,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 3173 proven. 132 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-03-08 02:04:02,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671392792] [2025-03-08 02:04:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671392792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362482736] [2025-03-08 02:04:02,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:02,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:02,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:02,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:02,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:04:02,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1510 statements into 1 equivalence classes. [2025-03-08 02:04:02,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1510 of 1510 statements. [2025-03-08 02:04:02,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:02,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:02,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 1751 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:04:02,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1927 proven. 201 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2025-03-08 02:04:04,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:04:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4105 backedges. 1927 proven. 201 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2025-03-08 02:04:07,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362482736] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:04:07,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:04:07,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-08 02:04:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678383982] [2025-03-08 02:04:07,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:04:07,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:04:07,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:07,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:04:07,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:04:07,943 INFO L87 Difference]: Start difference. First operand 8887 states and 9118 transitions. Second operand has 9 states, 9 states have (on average 201.22222222222223) internal successors, (1811), 9 states have internal predecessors, (1811), 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 02:04:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:12,335 INFO L93 Difference]: Finished difference Result 32248 states and 33144 transitions. [2025-03-08 02:04:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 02:04:12,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 201.22222222222223) internal successors, (1811), 9 states have internal predecessors, (1811), 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 1510 [2025-03-08 02:04:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:12,362 INFO L225 Difference]: With dead ends: 32248 [2025-03-08 02:04:12,363 INFO L226 Difference]: Without dead ends: 23363 [2025-03-08 02:04:12,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3045 GetRequests, 3027 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-03-08 02:04:12,374 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3154 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 8448 mSolverCounterSat, 743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3154 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 9191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 743 IncrementalHoareTripleChecker+Valid, 8448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:12,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3154 Valid, 108 Invalid, 9191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [743 Valid, 8448 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-08 02:04:12,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23363 states. [2025-03-08 02:04:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23363 to 16783. [2025-03-08 02:04:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0271719699678226) internal successors, (17238), 16782 states have internal predecessors, (17238), 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 02:04:12,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17238 transitions. [2025-03-08 02:04:12,545 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17238 transitions. Word has length 1510 [2025-03-08 02:04:12,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:12,546 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17238 transitions. [2025-03-08 02:04:12,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 201.22222222222223) internal successors, (1811), 9 states have internal predecessors, (1811), 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 02:04:12,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17238 transitions. [2025-03-08 02:04:12,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1603 [2025-03-08 02:04:12,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:12,569 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-03-08 02:04:12,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 02:04:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:12,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:12,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1769762181, now seen corresponding path program 1 times [2025-03-08 02:04:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:12,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932162846] [2025-03-08 02:04:12,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:12,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:12,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1602 statements into 1 equivalence classes. [2025-03-08 02:04:12,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1602 of 1602 statements. [2025-03-08 02:04:12,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:12,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4938 backedges. 2210 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-08 02:04:14,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:14,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932162846] [2025-03-08 02:04:14,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932162846] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:14,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:14,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:14,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103546414] [2025-03-08 02:04:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:14,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:14,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:14,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:14,054 INFO L87 Difference]: Start difference. First operand 16783 states and 17238 transitions. Second operand has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 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 02:04:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:14,968 INFO L93 Difference]: Finished difference Result 33564 states and 34477 transitions. [2025-03-08 02:04:14,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:04:14,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 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 1602 [2025-03-08 02:04:14,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:14,983 INFO L225 Difference]: With dead ends: 33564 [2025-03-08 02:04:14,983 INFO L226 Difference]: Without dead ends: 17112 [2025-03-08 02:04:14,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:14,994 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 268 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:14,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 108 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:04:15,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-03-08 02:04:15,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2025-03-08 02:04:15,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0267664075740752) internal successors, (17569), 17111 states have internal predecessors, (17569), 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 02:04:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17569 transitions. [2025-03-08 02:04:15,132 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17569 transitions. Word has length 1602 [2025-03-08 02:04:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:15,132 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17569 transitions. [2025-03-08 02:04:15,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 174.75) internal successors, (699), 3 states have internal predecessors, (699), 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 02:04:15,133 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17569 transitions. [2025-03-08 02:04:15,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1666 [2025-03-08 02:04:15,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:15,153 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:15,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:04:15,153 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1230053235, now seen corresponding path program 1 times [2025-03-08 02:04:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:15,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142157429] [2025-03-08 02:04:15,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:15,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:15,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1665 statements into 1 equivalence classes. [2025-03-08 02:04:15,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1665 of 1665 statements. [2025-03-08 02:04:15,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:15,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5180 backedges. 2935 proven. 0 refuted. 0 times theorem prover too weak. 2245 trivial. 0 not checked. [2025-03-08 02:04:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:16,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142157429] [2025-03-08 02:04:16,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142157429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:16,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:16,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:04:16,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973795011] [2025-03-08 02:04:16,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:16,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:16,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:16,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:16,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:04:16,447 INFO L87 Difference]: Start difference. First operand 17112 states and 17569 transitions. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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 02:04:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:17,108 INFO L93 Difference]: Finished difference Result 36525 states and 37478 transitions. [2025-03-08 02:04:17,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:17,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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 1665 [2025-03-08 02:04:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:17,126 INFO L225 Difference]: With dead ends: 36525 [2025-03-08 02:04:17,127 INFO L226 Difference]: Without dead ends: 20073 [2025-03-08 02:04:17,138 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 02:04:17,138 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 764 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:17,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 764 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:17,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-03-08 02:04:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 18099. [2025-03-08 02:04:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0259697204110951) internal successors, (18568), 18098 states have internal predecessors, (18568), 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 02:04:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18568 transitions. [2025-03-08 02:04:17,358 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18568 transitions. Word has length 1665 [2025-03-08 02:04:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:17,358 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18568 transitions. [2025-03-08 02:04:17,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 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 02:04:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18568 transitions. [2025-03-08 02:04:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1707 [2025-03-08 02:04:17,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:17,398 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2025-03-08 02:04:17,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:04:17,399 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 966401800, now seen corresponding path program 1 times [2025-03-08 02:04:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:17,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615914692] [2025-03-08 02:04:17,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:17,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1706 statements into 1 equivalence classes. [2025-03-08 02:04:17,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1706 of 1706 statements. [2025-03-08 02:04:17,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:17,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 4190 proven. 41 refuted. 0 times theorem prover too weak. 1601 trivial. 0 not checked. [2025-03-08 02:04:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615914692] [2025-03-08 02:04:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615914692] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:19,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536673418] [2025-03-08 02:04:19,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:19,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:19,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:19,419 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:19,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:04:19,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1706 statements into 1 equivalence classes. [2025-03-08 02:04:19,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1706 of 1706 statements. [2025-03-08 02:04:19,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:19,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:19,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:04:19,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2848 proven. 0 refuted. 0 times theorem prover too weak. 2984 trivial. 0 not checked. [2025-03-08 02:04:20,136 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:20,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536673418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:20,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:20,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 02:04:20,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913214268] [2025-03-08 02:04:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:20,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:20,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:20,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:20,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:04:20,138 INFO L87 Difference]: Start difference. First operand 18099 states and 18568 transitions. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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 02:04:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:20,687 INFO L93 Difference]: Finished difference Result 35538 states and 36472 transitions. [2025-03-08 02:04:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:20,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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 1706 [2025-03-08 02:04:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:20,708 INFO L225 Difference]: With dead ends: 35538 [2025-03-08 02:04:20,708 INFO L226 Difference]: Without dead ends: 18099 [2025-03-08 02:04:20,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1710 GetRequests, 1706 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 02:04:20,721 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:20,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 424 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:04:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-03-08 02:04:20,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 18099. [2025-03-08 02:04:20,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0255276826168638) internal successors, (18560), 18098 states have internal predecessors, (18560), 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 02:04:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18560 transitions. [2025-03-08 02:04:20,863 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18560 transitions. Word has length 1706 [2025-03-08 02:04:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:20,864 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18560 transitions. [2025-03-08 02:04:20,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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 02:04:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18560 transitions. [2025-03-08 02:04:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2116 [2025-03-08 02:04:20,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:20,895 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:20,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:04:21,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 02:04:21,096 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:21,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:21,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1467376703, now seen corresponding path program 1 times [2025-03-08 02:04:21,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:21,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926103687] [2025-03-08 02:04:21,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:21,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2115 statements into 1 equivalence classes. [2025-03-08 02:04:21,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2115 of 2115 statements. [2025-03-08 02:04:21,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:21,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:23,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8387 backedges. 5477 proven. 0 refuted. 0 times theorem prover too weak. 2910 trivial. 0 not checked. [2025-03-08 02:04:23,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:23,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926103687] [2025-03-08 02:04:23,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926103687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:23,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:04:23,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:04:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463155783] [2025-03-08 02:04:23,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:23,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:04:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:23,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:04:23,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:04:23,574 INFO L87 Difference]: Start difference. First operand 18099 states and 18560 transitions. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 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 02:04:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:24,337 INFO L93 Difference]: Finished difference Result 35551 states and 36469 transitions. [2025-03-08 02:04:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:04:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 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 2115 [2025-03-08 02:04:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:24,350 INFO L225 Difference]: With dead ends: 35551 [2025-03-08 02:04:24,350 INFO L226 Difference]: Without dead ends: 18112 [2025-03-08 02:04:24,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:04:24,360 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 218 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:24,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 436 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18112 states. [2025-03-08 02:04:24,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18112 to 18099. [2025-03-08 02:04:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0251961542711903) internal successors, (18554), 18098 states have internal predecessors, (18554), 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 02:04:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18554 transitions. [2025-03-08 02:04:24,547 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18554 transitions. Word has length 2115 [2025-03-08 02:04:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:24,550 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18554 transitions. [2025-03-08 02:04:24,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 4 states have internal predecessors, (821), 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 02:04:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18554 transitions. [2025-03-08 02:04:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2348 [2025-03-08 02:04:24,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:24,626 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 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] [2025-03-08 02:04:24,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:04:24,626 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:24,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:24,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1107426309, now seen corresponding path program 1 times [2025-03-08 02:04:24,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:24,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397585308] [2025-03-08 02:04:24,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:24,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:24,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2347 statements into 1 equivalence classes. [2025-03-08 02:04:24,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2347 of 2347 statements. [2025-03-08 02:04:24,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:24,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:27,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 7415 proven. 153 refuted. 0 times theorem prover too weak. 3098 trivial. 0 not checked. [2025-03-08 02:04:27,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397585308] [2025-03-08 02:04:27,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397585308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:27,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787911177] [2025-03-08 02:04:27,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:27,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:27,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:27,352 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:27,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 02:04:27,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2347 statements into 1 equivalence classes. [2025-03-08 02:04:27,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2347 of 2347 statements. [2025-03-08 02:04:27,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:27,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:27,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 2689 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:04:27,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10666 backedges. 5837 proven. 0 refuted. 0 times theorem prover too weak. 4829 trivial. 0 not checked. [2025-03-08 02:04:27,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:27,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787911177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:27,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:27,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:04:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435544190] [2025-03-08 02:04:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:27,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:27,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:27,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:27,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:27,912 INFO L87 Difference]: Start difference. First operand 18099 states and 18554 transitions. Second operand has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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 02:04:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:28,571 INFO L93 Difference]: Finished difference Result 37183 states and 38172 transitions. [2025-03-08 02:04:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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 2347 [2025-03-08 02:04:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:28,590 INFO L225 Difference]: With dead ends: 37183 [2025-03-08 02:04:28,590 INFO L226 Difference]: Without dead ends: 19744 [2025-03-08 02:04:28,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2352 GetRequests, 2347 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:28,605 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:28,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 426 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:04:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19744 states. [2025-03-08 02:04:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19744 to 19415. [2025-03-08 02:04:28,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0249819717729474) internal successors, (19899), 19414 states have internal predecessors, (19899), 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 02:04:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19899 transitions. [2025-03-08 02:04:28,843 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19899 transitions. Word has length 2347 [2025-03-08 02:04:28,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:28,844 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19899 transitions. [2025-03-08 02:04:28,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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 02:04:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19899 transitions. [2025-03-08 02:04:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2379 [2025-03-08 02:04:28,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:04:28,877 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:04:28,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:04:29,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:29,078 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:04:29,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:04:29,079 INFO L85 PathProgramCache]: Analyzing trace with hash 717013075, now seen corresponding path program 1 times [2025-03-08 02:04:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:04:29,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851673679] [2025-03-08 02:04:29,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:04:29,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2378 statements into 1 equivalence classes. [2025-03-08 02:04:29,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2378 of 2378 statements. [2025-03-08 02:04:29,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:29,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 8042 proven. 91 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2025-03-08 02:04:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:04:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851673679] [2025-03-08 02:04:31,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851673679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:04:31,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607892590] [2025-03-08 02:04:31,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:04:31,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:31,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:04:31,592 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:04:31,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:04:31,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2378 statements into 1 equivalence classes. [2025-03-08 02:04:32,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2378 of 2378 statements. [2025-03-08 02:04:32,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:04:32,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:04:32,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 2723 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:04:32,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:04:32,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 10538 trivial. 0 not checked. [2025-03-08 02:04:32,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:04:32,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607892590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:04:32,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:04:32,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:04:32,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006893068] [2025-03-08 02:04:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:04:32,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:04:32,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:04:32,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:04:32,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:32,270 INFO L87 Difference]: Start difference. First operand 19415 states and 19899 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 02:04:33,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:04:33,032 INFO L93 Difference]: Finished difference Result 41787 states and 42838 transitions. [2025-03-08 02:04:33,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:04:33,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 2378 [2025-03-08 02:04:33,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:04:33,034 INFO L225 Difference]: With dead ends: 41787 [2025-03-08 02:04:33,035 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:04:33,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2383 GetRequests, 2378 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:04:33,048 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 287 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:04:33,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 414 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:04:33,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:04:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:04:33,050 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 02:04:33,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:04:33,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2378 [2025-03-08 02:04:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:04:33,050 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:04:33,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 02:04:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:04:33,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:04:33,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:04:33,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 02:04:33,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:04:33,258 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:04:33,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 02:04:34,956 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 02:04:34,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 02:04:34 BoogieIcfgContainer [2025-03-08 02:04:34,972 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 02:04:34,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 02:04:34,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 02:04:34,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 02:04:34,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:03:41" (3/4) ... [2025-03-08 02:04:34,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 02:04:35,002 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 02:04:35,003 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 02:04:35,004 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 02:04:35,005 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 02:04:35,144 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 02:04:35,145 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 02:04:35,145 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 02:04:35,146 INFO L158 Benchmark]: Toolchain (without parser) took 56086.62ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 106.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 166.5MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,146 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 02:04:35,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 502.89ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 46.6MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 125.67ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 88.7MB in the end (delta: -42.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,147 INFO L158 Benchmark]: Boogie Preprocessor took 137.92ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 56.3MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,147 INFO L158 Benchmark]: IcfgBuilder took 1801.19ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 56.3MB in the beginning and 138.7MB in the end (delta: -82.4MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,147 INFO L158 Benchmark]: TraceAbstraction took 53339.98ms. Allocated memory was 327.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 138.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 793.5MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,147 INFO L158 Benchmark]: Witness Printer took 171.82ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 02:04:35,150 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 502.89ms. Allocated memory is still 142.6MB. Free memory was 105.1MB in the beginning and 46.6MB in the end (delta: 58.5MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 125.67ms. Allocated memory is still 142.6MB. Free memory was 46.6MB in the beginning and 88.7MB in the end (delta: -42.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 137.92ms. Allocated memory is still 142.6MB. Free memory was 88.7MB in the beginning and 56.3MB in the end (delta: 32.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * IcfgBuilder took 1801.19ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 56.3MB in the beginning and 138.7MB in the end (delta: -82.4MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53339.98ms. Allocated memory was 327.2MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 138.7MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 793.5MB. Max. memory is 16.1GB. * Witness Printer took 171.82ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 25.1MB). 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: 158]: 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, 396 locations, 722 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 51.6s, OverallIterations: 21, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8624 SdHoareTripleChecker+Valid, 18.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8624 mSDsluCounter, 6095 SdHoareTripleChecker+Invalid, 14.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 3305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25715 IncrementalHoareTripleChecker+Invalid, 29020 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3305 mSolverCounterUnsat, 5881 mSDtfsCounter, 25715 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10640 GetRequests, 10581 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19415occurred in iteration=20, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 11199 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 30800 NumberOfCodeBlocks, 30800 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 32282 ConstructedInterpolants, 0 QuantifiedInterpolants, 76899 SizeOfPredicates, 2 NumberOfNonLiveVariables, 10488 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 101248/102564 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: 1783]: Location Invariant Derived location invariant: (((((((((((((((((((a16 == 9) && (7 == a12)) || (((((0 < ((long long) a18 + 156)) || (a16 != 12)) && (a12 <= 5)) && (a15 <= 3)) && (11 <= a16))) || ((((a16 == 11) && (0 <= ((long long) a18 + 79))) && (a18 <= 158)) && (a15 <= 3))) || ((((0 <= ((long long) a18 + 79)) && (a15 <= 3)) && ((a12 != 9) || (a16 != 11))) && (11 <= a16))) || ((a16 <= 8) && (a12 <= 5))) || ((((a16 <= 8) && (a15 <= 3)) && (a12 <= 8)) && ((((long long) a18 + 113) < 0) || (((long long) a18 + 113) == 0)))) || ((a12 == 6) && (a16 <= 11))) || ((((a12 == 9) && (a16 == 8)) && (135 <= a18)) && (a15 == 3))) || ((a16 == 9) && (a15 <= 3))) || ((((a12 <= 5) && (a18 <= 132)) && (a16 <= 11)) && (4 <= a15))) || ((a16 <= 8) && (4 <= a15))) || ((((a12 <= 5) && (0 <= ((long long) a18 + 79))) && (a18 <= 132)) && (a16 <= 11))) || ((a15 <= 3) && (a12 == 8))) || (((a15 <= 3) && (11 <= a16)) && (7 == a12))) || ((((a12 <= 5) && (158 <= a18)) && (a16 <= 11)) && (4 <= a15))) || (((a16 <= 8) && (a15 <= 3)) && (((long long) 92610 + a18) <= 0))) || ((a16 == 9) && (a18 <= 158))) || ((((a15 <= 3) && (5 != a12)) && ((((long long) a18 + 113) < 0) || (((long long) a18 + 113) == 0))) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2025-03-08 02:04:35,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE