./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem14_label36.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 ec8d0e0fff6557971f4673d636c1311100eb98b16afa0105e7601631fec8f322 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:47:55,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:47:55,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:47:55,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:47:55,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:47:55,478 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:47:55,479 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:47:55,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:47:55,479 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:47:55,479 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:47:55,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:47:55,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:47:55,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:47:55,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:47:55,479 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:47:55,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:47:55,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:47:55,481 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:47:55,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:47:55,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:47:55,481 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:47:55,482 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:47:55,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:55,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:47:55,483 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:47:55,484 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:47:55,484 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:47:55,484 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:47:55,484 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:47:55,484 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 -> ec8d0e0fff6557971f4673d636c1311100eb98b16afa0105e7601631fec8f322 [2025-03-03 10:47:55,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:47:55,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:47:55,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:47:55,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:47:55,706 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:47:55,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label36.c [2025-03-03 10:47:56,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991723db0/ee0cf3eb3de04c59837b6eb6822bfd06/FLAG7cf87d211 [2025-03-03 10:47:57,214 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:47:57,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label36.c [2025-03-03 10:47:57,230 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991723db0/ee0cf3eb3de04c59837b6eb6822bfd06/FLAG7cf87d211 [2025-03-03 10:47:57,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/991723db0/ee0cf3eb3de04c59837b6eb6822bfd06 [2025-03-03 10:47:57,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:47:57,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:47:57,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:57,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:47:57,449 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:47:57,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,450 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b471830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57, skipping insertion in model container [2025-03-03 10:47:57,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,479 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:47:57,623 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/Problem14_label36.c[4997,5010] [2025-03-03 10:47:57,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:57,777 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:47:57,790 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/Problem14_label36.c[4997,5010] [2025-03-03 10:47:57,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:47:57,876 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:47:57,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57 WrapperNode [2025-03-03 10:47:57,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:47:57,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:57,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:47:57,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:47:57,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,895 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,935 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-03 10:47:57,936 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:47:57,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:47:57,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:47:57,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:47:57,944 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,952 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,982 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-03 10:47:57,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:57,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,001 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,011 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:47:58,024 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:47:58,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:47:58,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:47:58,026 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (1/1) ... [2025-03-03 10:47:58,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:47:58,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:47:58,053 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-03 10:47:58,055 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-03 10:47:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:47:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:47:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:47:58,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:47:58,120 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:47:58,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:47:59,060 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-03 10:47:59,060 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:47:59,073 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:47:59,075 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:47:59,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:59 BoogieIcfgContainer [2025-03-03 10:47:59,076 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:47:59,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:47:59,078 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:47:59,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:47:59,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:47:57" (1/3) ... [2025-03-03 10:47:59,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd78901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:59, skipping insertion in model container [2025-03-03 10:47:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:47:57" (2/3) ... [2025-03-03 10:47:59,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd78901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:47:59, skipping insertion in model container [2025-03-03 10:47:59,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:59" (3/3) ... [2025-03-03 10:47:59,083 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label36.c [2025-03-03 10:47:59,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:47:59,096 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label36.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:47:59,135 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:47:59,142 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;@68489f61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:47:59,142 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:47:59,146 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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-03 10:47:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 10:47:59,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:47:59,153 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, 1] [2025-03-03 10:47:59,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:47:59,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:47:59,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1592507583, now seen corresponding path program 1 times [2025-03-03 10:47:59,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:47:59,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944450134] [2025-03-03 10:47:59,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:47:59,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:47:59,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 10:47:59,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 10:47:59,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:47:59,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:47:59,422 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-03 10:47:59,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:47:59,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944450134] [2025-03-03 10:47:59,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944450134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:47:59,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:47:59,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:47:59,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626048399] [2025-03-03 10:47:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:47:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:47:59,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:47:59,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:47:59,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:47:59,447 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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-03 10:48:00,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:00,172 INFO L93 Difference]: Finished difference Result 685 states and 1213 transitions. [2025-03-03 10:48:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:00,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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 48 [2025-03-03 10:48:00,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:00,181 INFO L225 Difference]: With dead ends: 685 [2025-03-03 10:48:00,181 INFO L226 Difference]: Without dead ends: 360 [2025-03-03 10:48:00,184 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-03 10:48:00,186 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 170 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:00,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 139 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:48:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-03 10:48:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-03-03 10:48:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.4206128133704736) internal successors, (510), 359 states have internal predecessors, (510), 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-03 10:48:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 510 transitions. [2025-03-03 10:48:00,230 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 510 transitions. Word has length 48 [2025-03-03 10:48:00,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 510 transitions. [2025-03-03 10:48:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 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-03 10:48:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 510 transitions. [2025-03-03 10:48:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 10:48:00,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:00,234 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:48:00,234 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2072760367, now seen corresponding path program 1 times [2025-03-03 10:48:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708127973] [2025-03-03 10:48:00,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:00,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 10:48:00,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 10:48:00,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:00,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:00,625 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:00,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:00,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708127973] [2025-03-03 10:48:00,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708127973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159113352] [2025-03-03 10:48:00,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:00,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:00,628 INFO L87 Difference]: Start difference. First operand 360 states and 510 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-03 10:48:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:01,383 INFO L93 Difference]: Finished difference Result 1074 states and 1446 transitions. [2025-03-03 10:48:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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 127 [2025-03-03 10:48:01,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:01,387 INFO L225 Difference]: With dead ends: 1074 [2025-03-03 10:48:01,387 INFO L226 Difference]: Without dead ends: 716 [2025-03-03 10:48:01,388 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-03 10:48:01,388 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 419 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:01,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 121 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:48:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-03 10:48:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 716. [2025-03-03 10:48:01,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.2615384615384615) internal successors, (902), 715 states have internal predecessors, (902), 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-03 10:48:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 902 transitions. [2025-03-03 10:48:01,421 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 902 transitions. Word has length 127 [2025-03-03 10:48:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:01,421 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 902 transitions. [2025-03-03 10:48:01,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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-03 10:48:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 902 transitions. [2025-03-03 10:48:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 10:48:01,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:01,423 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, 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-03 10:48:01,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:48:01,423 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:01,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1317153168, now seen corresponding path program 1 times [2025-03-03 10:48:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:01,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255247657] [2025-03-03 10:48:01,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:01,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 10:48:01,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 10:48:01,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:01,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:01,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255247657] [2025-03-03 10:48:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255247657] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603101407] [2025-03-03 10:48:01,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:01,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:01,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:01,693 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-03 10:48:01,695 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-03 10:48:01,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 10:48:01,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 10:48:01,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:01,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:01,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:01,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:01,868 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:01,868 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603101407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 10:48:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796305849] [2025-03-03 10:48:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:01,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:01,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:01,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:01,870 INFO L87 Difference]: Start difference. First operand 716 states and 902 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-03 10:48:02,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:02,408 INFO L93 Difference]: Finished difference Result 1964 states and 2499 transitions. [2025-03-03 10:48:02,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:02,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 153 [2025-03-03 10:48:02,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:02,413 INFO L225 Difference]: With dead ends: 1964 [2025-03-03 10:48:02,413 INFO L226 Difference]: Without dead ends: 1250 [2025-03-03 10:48:02,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 152 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-03 10:48:02,415 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:02,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 95 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:48:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2025-03-03 10:48:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2025-03-03 10:48:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1249 states have (on average 1.2361889511609288) internal successors, (1544), 1249 states have internal predecessors, (1544), 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-03 10:48:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1544 transitions. [2025-03-03 10:48:02,434 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1544 transitions. Word has length 153 [2025-03-03 10:48:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:02,435 INFO L471 AbstractCegarLoop]: Abstraction has 1250 states and 1544 transitions. [2025-03-03 10:48:02,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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-03 10:48:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1544 transitions. [2025-03-03 10:48:02,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-03 10:48:02,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:02,441 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:02,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:02,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:02,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:02,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:02,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1330805498, now seen corresponding path program 1 times [2025-03-03 10:48:02,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:02,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852944911] [2025-03-03 10:48:02,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:02,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:02,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-03 10:48:02,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-03 10:48:02,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 10:48:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:02,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852944911] [2025-03-03 10:48:02,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852944911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:02,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:02,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705442971] [2025-03-03 10:48:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:02,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:02,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:02,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:02,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:02,868 INFO L87 Difference]: Start difference. First operand 1250 states and 1544 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:03,459 INFO L93 Difference]: Finished difference Result 2705 states and 3353 transitions. [2025-03-03 10:48:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:03,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2025-03-03 10:48:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:03,464 INFO L225 Difference]: With dead ends: 2705 [2025-03-03 10:48:03,464 INFO L226 Difference]: Without dead ends: 1606 [2025-03-03 10:48:03,465 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-03 10:48:03,466 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:03,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:48:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-03-03 10:48:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-03-03 10:48:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1221183800623054) internal successors, (1801), 1605 states have internal predecessors, (1801), 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-03 10:48:03,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1801 transitions. [2025-03-03 10:48:03,491 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1801 transitions. Word has length 207 [2025-03-03 10:48:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:03,491 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1801 transitions. [2025-03-03 10:48:03,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:03,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1801 transitions. [2025-03-03 10:48:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-03 10:48:03,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:03,494 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:03,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:48:03,495 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1485385728, now seen corresponding path program 1 times [2025-03-03 10:48:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689025087] [2025-03-03 10:48:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:03,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:03,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-03 10:48:03,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-03 10:48:03,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:03,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:03,858 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 185 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:48:03,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689025087] [2025-03-03 10:48:03,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689025087] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:03,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647418845] [2025-03-03 10:48:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:03,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:03,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:03,861 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-03 10:48:03,862 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-03 10:48:03,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-03 10:48:03,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-03 10:48:03,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:03,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:03,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:03,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-03 10:48:04,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:04,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647418845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:04,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:04,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 10:48:04,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841338430] [2025-03-03 10:48:04,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:04,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:04,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:04,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:04,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:04,226 INFO L87 Difference]: Start difference. First operand 1606 states and 1801 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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-03 10:48:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:04,661 INFO L93 Difference]: Finished difference Result 3388 states and 3901 transitions. [2025-03-03 10:48:04,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:04,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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 334 [2025-03-03 10:48:04,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:04,671 INFO L225 Difference]: With dead ends: 3388 [2025-03-03 10:48:04,671 INFO L226 Difference]: Without dead ends: 1962 [2025-03-03 10:48:04,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:04,674 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:04,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:04,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-03-03 10:48:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1784. [2025-03-03 10:48:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1784 states, 1783 states have (on average 1.1318003365114975) internal successors, (2018), 1783 states have internal predecessors, (2018), 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-03 10:48:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1784 states to 1784 states and 2018 transitions. [2025-03-03 10:48:04,703 INFO L78 Accepts]: Start accepts. Automaton has 1784 states and 2018 transitions. Word has length 334 [2025-03-03 10:48:04,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:04,704 INFO L471 AbstractCegarLoop]: Abstraction has 1784 states and 2018 transitions. [2025-03-03 10:48:04,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 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-03 10:48:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1784 states and 2018 transitions. [2025-03-03 10:48:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 10:48:04,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:04,707 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2025-03-03 10:48:04,713 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-03 10:48:04,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:04,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:04,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:04,908 INFO L85 PathProgramCache]: Analyzing trace with hash -116969930, now seen corresponding path program 1 times [2025-03-03 10:48:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:04,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291980355] [2025-03-03 10:48:04,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:04,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 10:48:04,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 10:48:04,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:04,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:05,336 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 268 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:48:05,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:05,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291980355] [2025-03-03 10:48:05,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291980355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534338526] [2025-03-03 10:48:05,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:05,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:05,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:05,339 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-03 10:48:05,340 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-03 10:48:05,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 10:48:05,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 10:48:05,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:05,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:05,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-03 10:48:05,487 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [534338526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:05,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:05,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:48:05,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629153384] [2025-03-03 10:48:05,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:05,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:05,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:05,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:05,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:05,488 INFO L87 Difference]: Start difference. First operand 1784 states and 2018 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-03 10:48:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:05,930 INFO L93 Difference]: Finished difference Result 3922 states and 4505 transitions. [2025-03-03 10:48:05,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:05,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 338 [2025-03-03 10:48:05,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:05,936 INFO L225 Difference]: With dead ends: 3922 [2025-03-03 10:48:05,936 INFO L226 Difference]: Without dead ends: 2318 [2025-03-03 10:48:05,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:05,938 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 133 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:05,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 258 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:05,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-03-03 10:48:05,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2318. [2025-03-03 10:48:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 2317 states have (on average 1.1225722917565817) internal successors, (2601), 2317 states have internal predecessors, (2601), 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-03 10:48:05,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 2601 transitions. [2025-03-03 10:48:05,970 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 2601 transitions. Word has length 338 [2025-03-03 10:48:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:05,970 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 2601 transitions. [2025-03-03 10:48:05,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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-03 10:48:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 2601 transitions. [2025-03-03 10:48:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-03 10:48:05,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:05,977 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:05,984 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-03 10:48:06,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:06,177 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:06,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -201611477, now seen corresponding path program 1 times [2025-03-03 10:48:06,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:06,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991464394] [2025-03-03 10:48:06,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:06,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:06,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 10:48:06,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 10:48:06,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:06,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:06,437 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-03 10:48:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991464394] [2025-03-03 10:48:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991464394] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047071305] [2025-03-03 10:48:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:06,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:06,439 INFO L87 Difference]: Start difference. First operand 2318 states and 2601 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03 10:48:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:06,830 INFO L93 Difference]: Finished difference Result 4812 states and 5448 transitions. [2025-03-03 10:48:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:06,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 367 [2025-03-03 10:48:06,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:06,853 INFO L225 Difference]: With dead ends: 4812 [2025-03-03 10:48:06,854 INFO L226 Difference]: Without dead ends: 2674 [2025-03-03 10:48:06,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-03 10:48:06,856 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:06,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2025-03-03 10:48:06,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2025-03-03 10:48:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 1.1208380097268986) internal successors, (2996), 2673 states have internal predecessors, (2996), 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-03 10:48:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 2996 transitions. [2025-03-03 10:48:06,892 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 2996 transitions. Word has length 367 [2025-03-03 10:48:06,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:06,893 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 2996 transitions. [2025-03-03 10:48:06,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03 10:48:06,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 2996 transitions. [2025-03-03 10:48:06,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-03 10:48:06,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:06,897 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:06,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:48:06,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:06,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:06,898 INFO L85 PathProgramCache]: Analyzing trace with hash 562474241, now seen corresponding path program 1 times [2025-03-03 10:48:06,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:06,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126704951] [2025-03-03 10:48:06,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:06,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-03 10:48:06,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-03 10:48:06,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:06,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:07,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:07,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126704951] [2025-03-03 10:48:07,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126704951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:07,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:07,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:07,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797694087] [2025-03-03 10:48:07,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:07,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:07,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:07,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:07,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:07,063 INFO L87 Difference]: Start difference. First operand 2674 states and 2996 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-03 10:48:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:07,495 INFO L93 Difference]: Finished difference Result 6236 states and 7081 transitions. [2025-03-03 10:48:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:07,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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 372 [2025-03-03 10:48:07,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:07,507 INFO L225 Difference]: With dead ends: 6236 [2025-03-03 10:48:07,507 INFO L226 Difference]: Without dead ends: 3742 [2025-03-03 10:48:07,510 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-03 10:48:07,510 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 146 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:07,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 58 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2025-03-03 10:48:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 3742. [2025-03-03 10:48:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.1242983159583) internal successors, (4206), 3741 states have internal predecessors, (4206), 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-03 10:48:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4206 transitions. [2025-03-03 10:48:07,567 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4206 transitions. Word has length 372 [2025-03-03 10:48:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:07,567 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4206 transitions. [2025-03-03 10:48:07,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 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-03 10:48:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4206 transitions. [2025-03-03 10:48:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2025-03-03 10:48:07,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:07,572 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, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:48:07,572 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:07,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1567132322, now seen corresponding path program 1 times [2025-03-03 10:48:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:07,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796776904] [2025-03-03 10:48:07,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:07,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:07,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 447 statements into 1 equivalence classes. [2025-03-03 10:48:07,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 447 of 447 statements. [2025-03-03 10:48:07,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:07,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-03 10:48:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:07,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796776904] [2025-03-03 10:48:07,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796776904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:07,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:07,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:07,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109921293] [2025-03-03 10:48:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:07,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:48:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:07,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:48:07,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:48:07,892 INFO L87 Difference]: Start difference. First operand 3742 states and 4206 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-03 10:48:08,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:08,368 INFO L93 Difference]: Finished difference Result 7540 states and 8485 transitions. [2025-03-03 10:48:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:48:08,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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 447 [2025-03-03 10:48:08,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:08,377 INFO L225 Difference]: With dead ends: 7540 [2025-03-03 10:48:08,377 INFO L226 Difference]: Without dead ends: 3920 [2025-03-03 10:48:08,380 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-03 10:48:08,381 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 141 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:08,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 17 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-03-03 10:48:08,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2025-03-03 10:48:08,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.083132852178562) internal successors, (4052), 3741 states have internal predecessors, (4052), 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-03 10:48:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 4052 transitions. [2025-03-03 10:48:08,442 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 4052 transitions. Word has length 447 [2025-03-03 10:48:08,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:08,442 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 4052 transitions. [2025-03-03 10:48:08,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 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-03 10:48:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 4052 transitions. [2025-03-03 10:48:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2025-03-03 10:48:08,445 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:08,445 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, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:48:08,445 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1322585761, now seen corresponding path program 2 times [2025-03-03 10:48:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824883104] [2025-03-03 10:48:08,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 10:48:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:08,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 473 statements into 2 equivalence classes. [2025-03-03 10:48:08,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 473 of 473 statements. [2025-03-03 10:48:08,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 10:48:08,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 488 proven. 11 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824883104] [2025-03-03 10:48:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824883104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457914039] [2025-03-03 10:48:08,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 10:48:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:08,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:08,773 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-03 10:48:08,775 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-03 10:48:08,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 473 statements into 2 equivalence classes. [2025-03-03 10:48:08,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 473 of 473 statements. [2025-03-03 10:48:08,872 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 10:48:08,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:08,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:48:08,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 499 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:09,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:09,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457914039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:09,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:09,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-03 10:48:09,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041752150] [2025-03-03 10:48:09,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:09,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:48:09,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:09,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:48:09,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:48:09,708 INFO L87 Difference]: Start difference. First operand 3742 states and 4052 transitions. Second operand has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 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-03 10:48:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:10,303 INFO L93 Difference]: Finished difference Result 8430 states and 9131 transitions. [2025-03-03 10:48:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:48:10,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 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 473 [2025-03-03 10:48:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:10,314 INFO L225 Difference]: With dead ends: 8430 [2025-03-03 10:48:10,314 INFO L226 Difference]: Without dead ends: 4868 [2025-03-03 10:48:10,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 470 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:48:10,318 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 294 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:10,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 16 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:48:10,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4868 states. [2025-03-03 10:48:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4868 to 4276. [2025-03-03 10:48:10,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0753216374269006) internal successors, (4597), 4275 states have internal predecessors, (4597), 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-03 10:48:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4597 transitions. [2025-03-03 10:48:10,391 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4597 transitions. Word has length 473 [2025-03-03 10:48:10,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:10,391 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4597 transitions. [2025-03-03 10:48:10,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.0) internal successors, (265), 4 states have internal predecessors, (265), 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-03 10:48:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4597 transitions. [2025-03-03 10:48:10,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-03 10:48:10,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:10,396 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:10,403 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-03 10:48:10,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:10,597 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:10,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:10,598 INFO L85 PathProgramCache]: Analyzing trace with hash -528468814, now seen corresponding path program 1 times [2025-03-03 10:48:10,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:10,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55818390] [2025-03-03 10:48:10,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:10,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:10,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-03 10:48:10,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-03 10:48:10,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:10,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:10,872 INFO L134 CoverageAnalysis]: Checked inductivity of 815 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:10,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55818390] [2025-03-03 10:48:10,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55818390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:10,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:10,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:48:10,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480061827] [2025-03-03 10:48:10,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:10,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:10,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:10,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:10,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:48:10,874 INFO L87 Difference]: Start difference. First operand 4276 states and 4597 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-03 10:48:11,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:11,271 INFO L93 Difference]: Finished difference Result 8728 states and 9452 transitions. [2025-03-03 10:48:11,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:11,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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 480 [2025-03-03 10:48:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:11,284 INFO L225 Difference]: With dead ends: 8728 [2025-03-03 10:48:11,284 INFO L226 Difference]: Without dead ends: 4632 [2025-03-03 10:48:11,288 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-03 10:48:11,289 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 74 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:11,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 226 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:48:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2025-03-03 10:48:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4276. [2025-03-03 10:48:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4275 states have (on average 1.0790643274853802) internal successors, (4613), 4275 states have internal predecessors, (4613), 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-03 10:48:11,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 4613 transitions. [2025-03-03 10:48:11,346 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 4613 transitions. Word has length 480 [2025-03-03 10:48:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:11,347 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 4613 transitions. [2025-03-03 10:48:11,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-03 10:48:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 4613 transitions. [2025-03-03 10:48:11,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 10:48:11,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:11,352 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, 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, 3, 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] [2025-03-03 10:48:11,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:48:11,352 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:11,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1816347695, now seen corresponding path program 1 times [2025-03-03 10:48:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984992675] [2025-03-03 10:48:11,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:11,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 10:48:11,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 10:48:11,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:11,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 460 proven. 46 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-03 10:48:11,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984992675] [2025-03-03 10:48:11,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984992675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:11,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295334794] [2025-03-03 10:48:11,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:11,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:11,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:11,575 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-03 10:48:11,577 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-03 10:48:11,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 10:48:11,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 10:48:11,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:11,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:11,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:11,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-03-03 10:48:12,084 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:12,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295334794] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:12,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:12,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 10:48:12,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356922739] [2025-03-03 10:48:12,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:12,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:12,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:12,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:12,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:12,085 INFO L87 Difference]: Start difference. First operand 4276 states and 4613 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-03 10:48:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:12,429 INFO L93 Difference]: Finished difference Result 5524 states and 5938 transitions. [2025-03-03 10:48:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:12,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 527 [2025-03-03 10:48:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:12,441 INFO L225 Difference]: With dead ends: 5524 [2025-03-03 10:48:12,442 INFO L226 Difference]: Without dead ends: 5522 [2025-03-03 10:48:12,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:12,444 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:12,444 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:48:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5522 states. [2025-03-03 10:48:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5522 to 4454. [2025-03-03 10:48:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0810689422860993) internal successors, (4814), 4453 states have internal predecessors, (4814), 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-03 10:48:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4814 transitions. [2025-03-03 10:48:12,486 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4814 transitions. Word has length 527 [2025-03-03 10:48:12,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:12,487 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4814 transitions. [2025-03-03 10:48:12,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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-03 10:48:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4814 transitions. [2025-03-03 10:48:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2025-03-03 10:48:12,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:12,492 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:12,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:48:12,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:48:12,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:12,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:12,697 INFO L85 PathProgramCache]: Analyzing trace with hash 2069311124, now seen corresponding path program 1 times [2025-03-03 10:48:12,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:12,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112616864] [2025-03-03 10:48:12,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:12,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:12,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 10:48:12,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 10:48:12,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:12,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 1230 proven. 104 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-03 10:48:13,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112616864] [2025-03-03 10:48:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112616864] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:13,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049581766] [2025-03-03 10:48:13,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:13,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:13,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:13,115 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-03 10:48:13,118 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-03 10:48:13,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 658 statements into 1 equivalence classes. [2025-03-03 10:48:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 658 of 658 statements. [2025-03-03 10:48:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:13,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:13,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1694 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 1419 trivial. 0 not checked. [2025-03-03 10:48:13,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:13,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049581766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:13,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:13,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:48:13,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596018628] [2025-03-03 10:48:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:13,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:13,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:13,317 INFO L87 Difference]: Start difference. First operand 4454 states and 4814 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-03 10:48:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:13,611 INFO L93 Difference]: Finished difference Result 6058 states and 6512 transitions. [2025-03-03 10:48:13,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:13,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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 658 [2025-03-03 10:48:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:13,624 INFO L225 Difference]: With dead ends: 6058 [2025-03-03 10:48:13,624 INFO L226 Difference]: Without dead ends: 6056 [2025-03-03 10:48:13,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 657 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:13,626 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 154 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:13,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 11 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:48:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2025-03-03 10:48:13,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 4454. [2025-03-03 10:48:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4454 states, 4453 states have (on average 1.0810689422860993) internal successors, (4814), 4453 states have internal predecessors, (4814), 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-03 10:48:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4454 states to 4454 states and 4814 transitions. [2025-03-03 10:48:13,668 INFO L78 Accepts]: Start accepts. Automaton has 4454 states and 4814 transitions. Word has length 658 [2025-03-03 10:48:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 4454 states and 4814 transitions. [2025-03-03 10:48:13,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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-03 10:48:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 4454 states and 4814 transitions. [2025-03-03 10:48:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2025-03-03 10:48:13,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:13,674 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 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, 3, 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] [2025-03-03 10:48:13,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:48:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:13,875 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash 345487830, now seen corresponding path program 1 times [2025-03-03 10:48:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022313838] [2025-03-03 10:48:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:13,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:13,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 665 statements into 1 equivalence classes. [2025-03-03 10:48:13,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 665 of 665 statements. [2025-03-03 10:48:13,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:13,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:14,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 1295 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-03 10:48:14,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:14,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022313838] [2025-03-03 10:48:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022313838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:14,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:48:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:48:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780398867] [2025-03-03 10:48:14,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:14,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 10:48:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:14,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 10:48:14,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:48:14,368 INFO L87 Difference]: Start difference. First operand 4454 states and 4814 transitions. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:15,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:15,197 INFO L93 Difference]: Finished difference Result 9974 states and 10770 transitions. [2025-03-03 10:48:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:48:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 665 [2025-03-03 10:48:15,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:15,205 INFO L225 Difference]: With dead ends: 9974 [2025-03-03 10:48:15,205 INFO L226 Difference]: Without dead ends: 5700 [2025-03-03 10:48:15,208 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:48:15,208 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 285 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1658 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:15,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 70 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:48:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-03-03 10:48:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5344. [2025-03-03 10:48:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.0743028261276437) internal successors, (5740), 5343 states have internal predecessors, (5740), 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-03 10:48:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5740 transitions. [2025-03-03 10:48:15,252 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5740 transitions. Word has length 665 [2025-03-03 10:48:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:15,252 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 5740 transitions. [2025-03-03 10:48:15,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:48:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5740 transitions. [2025-03-03 10:48:15,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 793 [2025-03-03 10:48:15,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:48:15,259 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:48:15,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:48:15,260 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:48:15,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:48:15,260 INFO L85 PathProgramCache]: Analyzing trace with hash -614224403, now seen corresponding path program 1 times [2025-03-03 10:48:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:48:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247124173] [2025-03-03 10:48:15,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:15,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:48:15,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 10:48:15,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 10:48:15,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:15,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:15,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 1324 proven. 155 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-03 10:48:15,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:48:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247124173] [2025-03-03 10:48:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247124173] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:48:15,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479142590] [2025-03-03 10:48:15,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:48:15,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:15,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:48:15,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:48:15,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:48:15,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 792 statements into 1 equivalence classes. [2025-03-03 10:48:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 792 of 792 statements. [2025-03-03 10:48:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:48:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:48:15,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:48:15,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:48:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1839 backedges. 275 proven. 0 refuted. 0 times theorem prover too weak. 1564 trivial. 0 not checked. [2025-03-03 10:48:15,777 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:48:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479142590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:48:15,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:48:15,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:48:15,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009390820] [2025-03-03 10:48:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:48:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:48:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:48:15,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:48:15,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:15,779 INFO L87 Difference]: Start difference. First operand 5344 states and 5740 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-03 10:48:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:48:16,123 INFO L93 Difference]: Finished difference Result 11574 states and 12482 transitions. [2025-03-03 10:48:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:48:16,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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 792 [2025-03-03 10:48:16,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:48:16,124 INFO L225 Difference]: With dead ends: 11574 [2025-03-03 10:48:16,124 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:48:16,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 795 GetRequests, 792 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:48:16,129 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:48:16,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 46 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:48:16,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:48:16,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:48:16,130 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-03 10:48:16,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:48:16,130 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 792 [2025-03-03 10:48:16,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:48:16,130 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:48:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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-03 10:48:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:48:16,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:48:16,132 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:48:16,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 10:48:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:48:16,336 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:48:16,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:48:16,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:48:16,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:48:16 BoogieIcfgContainer [2025-03-03 10:48:16,746 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:48:16,747 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:48:16,747 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:48:16,747 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:48:16,747 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:47:59" (3/4) ... [2025-03-03 10:48:16,749 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:48:16,767 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:48:16,768 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:48:16,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:48:16,769 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:48:16,865 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:48:16,866 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:48:16,866 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:48:16,866 INFO L158 Benchmark]: Toolchain (without parser) took 19421.35ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 121.0MB in the beginning and 262.1MB in the end (delta: -141.1MB). Peak memory consumption was 245.9MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,867 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:48:16,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.75ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 89.2MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.75ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 80.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,868 INFO L158 Benchmark]: Boogie Preprocessor took 87.24ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 69.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,868 INFO L158 Benchmark]: IcfgBuilder took 1051.84ms. Allocated memory is still 167.8MB. Free memory was 69.0MB in the beginning and 115.5MB in the end (delta: -46.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,868 INFO L158 Benchmark]: TraceAbstraction took 17668.51ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 115.5MB in the beginning and 274.6MB in the end (delta: -159.2MB). Peak memory consumption was 221.5MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,868 INFO L158 Benchmark]: Witness Printer took 119.26ms. Allocated memory is still 553.6MB. Free memory was 274.6MB in the beginning and 262.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:48:16,870 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.75ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 89.2MB in the end (delta: 31.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.75ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 80.0MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.24ms. Allocated memory is still 167.8MB. Free memory was 80.0MB in the beginning and 69.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1051.84ms. Allocated memory is still 167.8MB. Free memory was 69.0MB in the beginning and 115.5MB in the end (delta: -46.5MB). Peak memory consumption was 52.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17668.51ms. Allocated memory was 167.8MB in the beginning and 553.6MB in the end (delta: 385.9MB). Free memory was 115.5MB in the beginning and 274.6MB in the end (delta: -159.2MB). Peak memory consumption was 221.5MB. Max. memory is 16.1GB. * Witness Printer took 119.26ms. Allocated memory is still 553.6MB. Free memory was 274.6MB in the beginning and 262.1MB in the end (delta: 12.6MB). 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2397 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2397 mSDsluCounter, 1311 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 1014 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9173 IncrementalHoareTripleChecker+Invalid, 10187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1014 mSolverCounterUnsat, 1213 mSDtfsCounter, 9173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3324 GetRequests, 3279 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=14, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 4330 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 9263 NumberOfCodeBlocks, 9263 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 9241 ConstructedInterpolants, 0 QuantifiedInterpolants, 35272 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4201 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 15699/16320 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: 890]: Location Invariant Derived location invariant: (((((((a24 == 1) && (10 <= a21)) || ((7 <= a15) && (a24 == 1))) || (((a15 <= 8) && (a21 <= 7)) && (((long long) 49 + a12) <= 0))) || ((a12 <= 80) && (a24 == 1))) || ((a24 == 1) && (a21 == 9))) || ((a24 == 1) && (a21 <= 7))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:48:16,886 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