./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/list-properties/simple_built_from_end.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/list-properties/simple_built_from_end.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 e74492965e3137bc379e6dde8e8bc07d12ce8a0174ba3d1de9269261a949155b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 10:54:16,301 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 10:54:16,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-29 10:54:16,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 10:54:16,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 10:54:16,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 10:54:16,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 10:54:16,379 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 10:54:16,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 10:54:16,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 10:54:16,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 10:54:16,381 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 10:54:16,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 10:54:16,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 10:54:16,381 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 10:54:16,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 10:54:16,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 10:54:16,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 10:54:16,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 10:54:16,383 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 10:54:16,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:16,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:16,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:16,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:16,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 10:54:16,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:16,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 10:54:16,384 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 10:54:16,384 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 -> e74492965e3137bc379e6dde8e8bc07d12ce8a0174ba3d1de9269261a949155b [2025-04-29 10:54:16,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 10:54:16,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 10:54:16,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 10:54:16,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 10:54:16,593 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 10:54:16,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end.c [2025-04-29 10:54:17,846 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71444c323/d819c2cad0c34a0484bc82509d304f12/FLAG458f527c6 [2025-04-29 10:54:18,029 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 10:54:18,030 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.c [2025-04-29 10:54:18,035 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:18,035 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 10:54:18,054 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71444c323/d819c2cad0c34a0484bc82509d304f12/FLAG458f527c6 [2025-04-29 10:54:18,898 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71444c323/d819c2cad0c34a0484bc82509d304f12 [2025-04-29 10:54:18,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 10:54:18,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 10:54:18,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:18,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 10:54:18,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 10:54:18,905 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:18" (1/1) ... [2025-04-29 10:54:18,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b899266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:18, skipping insertion in model container [2025-04-29 10:54:18,906 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 10:54:18" (1/1) ... [2025-04-29 10:54:18,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 10:54:19,056 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.c[726,739] [2025-04-29 10:54:19,061 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:19,068 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 10:54:19,084 WARN L117 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.c[726,739] [2025-04-29 10:54:19,085 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 10:54:19,097 INFO L204 MainTranslator]: Completed translation [2025-04-29 10:54:19,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19 WrapperNode [2025-04-29 10:54:19,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 10:54:19,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:19,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 10:54:19,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 10:54:19,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,122 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 35 [2025-04-29 10:54:19,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 10:54:19,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 10:54:19,123 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 10:54:19,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 10:54:19,129 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,139 INFO L175 MemorySlicer]: Split 4 memory accesses to 1 slices as follows [4]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2025-04-29 10:54:19,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,140 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,143 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,145 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 10:54:19,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 10:54:19,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 10:54:19,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 10:54:19,156 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (1/1) ... [2025-04-29 10:54:19,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 10:54:19,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:19,180 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-04-29 10:54:19,182 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-04-29 10:54:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 10:54:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 10:54:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 10:54:19,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 10:54:19,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 10:54:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 10:54:19,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 10:54:19,248 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 10:54:19,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 10:54:19,360 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-04-29 10:54:19,361 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 10:54:19,366 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 10:54:19,367 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-29 10:54:19,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:19 BoogieIcfgContainer [2025-04-29 10:54:19,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 10:54:19,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 10:54:19,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 10:54:19,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 10:54:19,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 10:54:18" (1/3) ... [2025-04-29 10:54:19,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:19, skipping insertion in model container [2025-04-29 10:54:19,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 10:54:19" (2/3) ... [2025-04-29 10:54:19,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@196cde6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 10:54:19, skipping insertion in model container [2025-04-29 10:54:19,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 10:54:19" (3/3) ... [2025-04-29 10:54:19,376 INFO L128 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.c [2025-04-29 10:54:19,386 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 10:54:19,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG simple_built_from_end.c that has 1 procedures, 16 locations, 20 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-29 10:54:19,423 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 10:54:19,430 INFO L340 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;@2ca6d542, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 10:54:19,430 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-29 10:54:19,433 INFO L278 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-04-29 10:54:19,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-29 10:54:19,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:19,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 10:54:19,437 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:19,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:19,440 INFO L85 PathProgramCache]: Analyzing trace with hash 890062825, now seen corresponding path program 1 times [2025-04-29 10:54:19,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:19,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74390937] [2025-04-29 10:54:19,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:19,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 10:54:19,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 10:54:19,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:19,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:19,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:19,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74390937] [2025-04-29 10:54:19,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74390937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:19,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:19,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 10:54:19,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222529343] [2025-04-29 10:54:19,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:19,521 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-29 10:54:19,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:19,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-29 10:54:19,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:54:19,535 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-29 10:54:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:19,546 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-04-29 10:54:19,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-29 10:54:19,547 INFO L79 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2025-04-29 10:54:19,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:19,553 INFO L225 Difference]: With dead ends: 24 [2025-04-29 10:54:19,553 INFO L226 Difference]: Without dead ends: 12 [2025-04-29 10:54:19,555 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-29 10:54:19,558 INFO L437 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:19,559 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-04-29 10:54:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-04-29 10:54:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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-04-29 10:54:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2025-04-29 10:54:19,577 INFO L79 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 6 [2025-04-29 10:54:19,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:19,577 INFO L485 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2025-04-29 10:54:19,578 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-04-29 10:54:19,578 INFO L278 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2025-04-29 10:54:19,578 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 10:54:19,578 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:19,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:19,578 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 10:54:19,578 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:19,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:19,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1805964373, now seen corresponding path program 1 times [2025-04-29 10:54:19,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:19,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308197998] [2025-04-29 10:54:19,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:19,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:19,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 10:54:19,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 10:54:19,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:19,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:19,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:19,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308197998] [2025-04-29 10:54:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308197998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:19,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:19,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 10:54:19,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234818320] [2025-04-29 10:54:19,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:19,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 10:54:19,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:19,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 10:54:19,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 10:54:19,645 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-04-29 10:54:19,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:19,660 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-04-29 10:54:19,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 10:54:19,661 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2025-04-29 10:54:19,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:19,661 INFO L225 Difference]: With dead ends: 23 [2025-04-29 10:54:19,661 INFO L226 Difference]: Without dead ends: 17 [2025-04-29 10:54:19,661 INFO L436 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-04-29 10:54:19,662 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:19,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 21 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-29 10:54:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2025-04-29 10:54:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 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-04-29 10:54:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-04-29 10:54:19,665 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2025-04-29 10:54:19,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:19,665 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-04-29 10:54:19,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-04-29 10:54:19,665 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-04-29 10:54:19,665 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-29 10:54:19,665 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:19,665 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:19,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 10:54:19,665 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:19,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:19,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1612866095, now seen corresponding path program 1 times [2025-04-29 10:54:19,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:19,666 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014942088] [2025-04-29 10:54:19,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:19,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:19,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 10:54:19,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 10:54:19,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:19,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:19,816 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014942088] [2025-04-29 10:54:19,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014942088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 10:54:19,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 10:54:19,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 10:54:19,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238905487] [2025-04-29 10:54:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 10:54:19,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 10:54:19,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 10:54:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 10:54:19,817 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-29 10:54:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:19,852 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-04-29 10:54:19,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 10:54:19,853 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2025-04-29 10:54:19,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:19,853 INFO L225 Difference]: With dead ends: 22 [2025-04-29 10:54:19,853 INFO L226 Difference]: Without dead ends: 20 [2025-04-29 10:54:19,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-29 10:54:19,854 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:19,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-04-29 10:54:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2025-04-29 10:54:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-04-29 10:54:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-04-29 10:54:19,858 INFO L79 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2025-04-29 10:54:19,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:19,858 INFO L485 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-04-29 10:54:19,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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-04-29 10:54:19,858 INFO L278 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-04-29 10:54:19,858 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 10:54:19,858 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:19,859 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:19,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 10:54:19,859 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:19,859 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1099489262, now seen corresponding path program 1 times [2025-04-29 10:54:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:19,859 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391606591] [2025-04-29 10:54:19,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:19,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:54:19,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:54:19,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:19,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:20,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391606591] [2025-04-29 10:54:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391606591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:20,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773538370] [2025-04-29 10:54:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 10:54:20,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:20,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:20,123 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-04-29 10:54:20,124 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-04-29 10:54:20,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 10:54:20,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 10:54:20,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 10:54:20,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:20,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-29 10:54:20,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:20,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:20,270 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:20,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:20,330 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773538370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:20,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:20,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 6 [2025-04-29 10:54:20,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244113488] [2025-04-29 10:54:20,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:20,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 10:54:20,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:20,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 10:54:20,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:54:20,397 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-04-29 10:54:20,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:20,431 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2025-04-29 10:54:20,431 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 10:54:20,431 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 15 [2025-04-29 10:54:20,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:20,432 INFO L225 Difference]: With dead ends: 33 [2025-04-29 10:54:20,432 INFO L226 Difference]: Without dead ends: 24 [2025-04-29 10:54:20,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-29 10:54:20,433 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:20,433 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 40 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 10:54:20,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-04-29 10:54:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2025-04-29 10:54:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 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-04-29 10:54:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-04-29 10:54:20,435 INFO L79 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2025-04-29 10:54:20,435 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:20,436 INFO L485 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-04-29 10:54:20,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-04-29 10:54:20,436 INFO L278 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-04-29 10:54:20,436 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-29 10:54:20,436 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:20,436 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 10:54:20,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 10:54:20,640 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:20,641 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:20,641 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:20,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1550840776, now seen corresponding path program 2 times [2025-04-29 10:54:20,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:20,641 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994210040] [2025-04-29 10:54:20,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:20,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:20,651 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-29 10:54:20,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:54:20,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:20,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:20,979 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:20,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:20,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994210040] [2025-04-29 10:54:20,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994210040] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:20,980 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381283306] [2025-04-29 10:54:20,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 10:54:20,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:20,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:20,982 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-04-29 10:54:20,983 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-04-29 10:54:21,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-29 10:54:21,034 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 10:54:21,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 10:54:21,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:21,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-29 10:54:21,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:21,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:21,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-29 10:54:21,094 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:21,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:54:21,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:54:21,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:21,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:54:21,179 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-29 10:54:21,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 10:54:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:21,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:21,225 WARN L849 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_100 (Array Int Int))) (= (select (select (store |c_#memory_int#0| |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_100) |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) 1)) is different from false [2025-04-29 10:54:21,291 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:21,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2025-04-29 10:54:21,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-04-29 10:54:21,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-04-29 10:54:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 10:54:21,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381283306] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:21,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:21,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-04-29 10:54:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140434967] [2025-04-29 10:54:21,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:21,315 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 10:54:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:21,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 10:54:21,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2025-04-29 10:54:21,316 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-04-29 10:54:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:21,461 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2025-04-29 10:54:21,461 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 10:54:21,461 INFO L79 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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 20 [2025-04-29 10:54:21,461 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:21,461 INFO L225 Difference]: With dead ends: 30 [2025-04-29 10:54:21,461 INFO L226 Difference]: Without dead ends: 28 [2025-04-29 10:54:21,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=225, Unknown=1, NotChecked=32, Total=342 [2025-04-29 10:54:21,466 INFO L437 NwaCegarLoop]: 12 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:21,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 73 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2025-04-29 10:54:21,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-04-29 10:54:21,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2025-04-29 10:54:21,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 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-04-29 10:54:21,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2025-04-29 10:54:21,468 INFO L79 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2025-04-29 10:54:21,468 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:21,469 INFO L485 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2025-04-29 10:54:21,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.857142857142857) internal successors, (40), 14 states have internal predecessors, (40), 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-04-29 10:54:21,469 INFO L278 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2025-04-29 10:54:21,469 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-29 10:54:21,469 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:21,469 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 10:54:21,475 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-04-29 10:54:21,669 WARN L466 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-04-29 10:54:21,670 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:21,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:21,670 INFO L85 PathProgramCache]: Analyzing trace with hash 139148213, now seen corresponding path program 3 times [2025-04-29 10:54:21,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:21,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386161698] [2025-04-29 10:54:21,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:54:21,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:21,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-29 10:54:21,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:54:21,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 10:54:21,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:22,057 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:22,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:22,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386161698] [2025-04-29 10:54:22,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386161698] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:22,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [386219046] [2025-04-29 10:54:22,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 10:54:22,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:22,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:22,062 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-04-29 10:54:22,064 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-04-29 10:54:22,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 3 equivalence classes. [2025-04-29 10:54:22,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 23 of 23 statements. [2025-04-29 10:54:22,119 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 10:54:22,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:22,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-29 10:54:22,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:22,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:22,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:22,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:22,206 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 10:54:22,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-04-29 10:54:22,235 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:54:22,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2025-04-29 10:54:22,249 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 10:54:22,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:54:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:22,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:22,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,451 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:54:22,458 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,458 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:54:22,464 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~t~0#1.offset| 4))) (and (forall ((v_arrayElimArr_3 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_3) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_3 .cse1) |c_ULTIMATE.start_main_~p~0#1.base|)))) (forall ((v_arrayElimArr_4 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~t~0#1.base| v_arrayElimArr_4) |c_ULTIMATE.start_main_~p~0#1.base|) .cse0) 0) (not (= (select v_arrayElimArr_4 .cse1) |c_ULTIMATE.start_main_~p~0#1.offset|)))))) is different from false [2025-04-29 10:54:22,597 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,597 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 10:54:22,601 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-29 10:54:22,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,608 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 10:54:22,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-04-29 10:54:22,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2025-04-29 10:54:22,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:22,653 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2025-04-29 10:54:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-04-29 10:54:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [386219046] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:22,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-04-29 10:54:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946003430] [2025-04-29 10:54:22,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:22,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 10:54:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:22,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 10:54:22,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=145, Unknown=1, NotChecked=24, Total=210 [2025-04-29 10:54:22,793 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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-04-29 10:54:22,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:22,904 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2025-04-29 10:54:22,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 10:54:22,905 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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 23 [2025-04-29 10:54:22,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:22,905 INFO L225 Difference]: With dead ends: 44 [2025-04-29 10:54:22,906 INFO L226 Difference]: Without dead ends: 32 [2025-04-29 10:54:22,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=166, Unknown=1, NotChecked=26, Total=240 [2025-04-29 10:54:22,906 INFO L437 NwaCegarLoop]: 16 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:22,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2025-04-29 10:54:22,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-04-29 10:54:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-04-29 10:54:22,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 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-04-29 10:54:22,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2025-04-29 10:54:22,912 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2025-04-29 10:54:22,912 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:22,912 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2025-04-29 10:54:22,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 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-04-29 10:54:22,912 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2025-04-29 10:54:22,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-29 10:54:22,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:22,912 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2025-04-29 10:54:22,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:23,113 WARN L466 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-04-29 10:54:23,113 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:23,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:23,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1565141617, now seen corresponding path program 4 times [2025-04-29 10:54:23,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:23,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561020009] [2025-04-29 10:54:23,114 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:54:23,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:23,126 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-29 10:54:23,139 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-29 10:54:23,140 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:54:23,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:23,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:23,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561020009] [2025-04-29 10:54:23,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561020009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:23,758 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433736648] [2025-04-29 10:54:23,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 10:54:23,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:23,760 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-04-29 10:54:23,761 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-04-29 10:54:23,799 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-29 10:54:23,816 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 24 of 28 statements. [2025-04-29 10:54:23,816 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 10:54:23,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:23,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-29 10:54:23,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:23,831 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:23,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-29 10:54:23,888 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 10:54:23,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-29 10:54:23,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:23,938 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 10:54:23,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-04-29 10:54:23,951 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:54:24,012 INFO L325 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-04-29 10:54:24,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-04-29 10:54:24,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:54:24,082 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 35 [2025-04-29 10:54:24,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2025-04-29 10:54:24,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2025-04-29 10:54:24,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 10:54:24,465 INFO L325 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2025-04-29 10:54:24,465 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 115 treesize of output 121 [2025-04-29 10:54:24,524 INFO L325 Elim1Store]: treesize reduction 24, result has 70.4 percent of original size [2025-04-29 10:54:24,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 99 [2025-04-29 10:54:24,800 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:24,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:54:24,921 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:24,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2025-04-29 10:54:24,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:24,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2025-04-29 10:54:25,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 56 [2025-04-29 10:54:25,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:25,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 88 [2025-04-29 10:54:25,097 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 74 [2025-04-29 10:54:25,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,109 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 43 [2025-04-29 10:54:25,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:25,120 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 98 [2025-04-29 10:54:25,131 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,131 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 58 [2025-04-29 10:54:25,280 INFO L325 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-04-29 10:54:25,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2025-04-29 10:54:25,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:54:25,300 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2025-04-29 10:54:25,562 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 46 [2025-04-29 10:54:25,565 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:54:25,566 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2025-04-29 10:54:25,573 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:54:25,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2025-04-29 10:54:25,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2025-04-29 10:54:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 18 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:25,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433736648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:54:25,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:54:25,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 33 [2025-04-29 10:54:25,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585970387] [2025-04-29 10:54:25,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:54:25,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-29 10:54:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:54:25,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-29 10:54:25,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=922, Unknown=6, NotChecked=0, Total=1056 [2025-04-29 10:54:25,643 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 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-04-29 10:54:26,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:54:26,033 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2025-04-29 10:54:26,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 10:54:26,033 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 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 28 [2025-04-29 10:54:26,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:54:26,033 INFO L225 Difference]: With dead ends: 38 [2025-04-29 10:54:26,034 INFO L226 Difference]: Without dead ends: 36 [2025-04-29 10:54:26,034 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=1350, Unknown=6, NotChecked=0, Total=1640 [2025-04-29 10:54:26,035 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 10:54:26,035 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 152 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 10:54:26,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-04-29 10:54:26,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-29 10:54:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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-04-29 10:54:26,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2025-04-29 10:54:26,039 INFO L79 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2025-04-29 10:54:26,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:54:26,039 INFO L485 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2025-04-29 10:54:26,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 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-04-29 10:54:26,039 INFO L278 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2025-04-29 10:54:26,040 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-29 10:54:26,040 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:54:26,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-04-29 10:54:26,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 10:54:26,240 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:26,240 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:54:26,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:54:26,241 INFO L85 PathProgramCache]: Analyzing trace with hash -964153202, now seen corresponding path program 5 times [2025-04-29 10:54:26,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:54:26,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303495832] [2025-04-29 10:54:26,241 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:26,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:54:26,251 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-29 10:54:26,278 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:54:26,278 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-29 10:54:26,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:26,746 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:54:26,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:54:26,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303495832] [2025-04-29 10:54:26,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303495832] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:54:26,746 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223290974] [2025-04-29 10:54:26,746 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-29 10:54:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:54:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:54:26,748 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-04-29 10:54:26,750 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-04-29 10:54:26,793 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-29 10:54:26,821 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 10:54:26,821 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-29 10:54:26,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:54:26,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-04-29 10:54:26,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:54:26,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:54:26,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:26,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:54:26,885 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:54:26,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:54:26,922 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-04-29 10:54:26,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 10:54:26,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2025-04-29 10:54:26,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2025-04-29 10:54:26,991 INFO L325 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2025-04-29 10:54:26,991 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 24 [2025-04-29 10:54:27,040 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:54:27,052 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:54:27,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 58 [2025-04-29 10:54:27,056 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:54:27,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2025-04-29 10:55:02,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:02,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 10:55:03,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:03,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2025-04-29 10:55:03,148 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:03,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 39 [2025-04-29 10:55:03,242 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:03,242 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 49 [2025-04-29 10:55:03,279 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:03,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 39 [2025-04-29 10:55:05,044 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:05,044 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 68 [2025-04-29 10:55:05,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:05,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 54 [2025-04-29 10:55:05,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:05,219 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2025-04-29 10:55:05,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:05,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2025-04-29 10:55:07,190 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:07,190 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 74 [2025-04-29 10:55:07,228 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:07,229 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2025-04-29 10:55:07,242 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:07,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:07,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 152 [2025-04-29 10:55:07,280 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:07,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 116 [2025-04-29 10:55:07,311 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 98 [2025-04-29 10:55:07,378 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:07,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 68 [2025-04-29 10:55:07,460 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:07,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2025-04-29 10:55:07,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-04-29 10:55:08,390 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:08,390 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 74 [2025-04-29 10:55:08,426 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:08,426 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2025-04-29 10:55:08,439 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:08,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:08,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:08,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 492 treesize of output 426 [2025-04-29 10:55:08,516 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-29 10:55:08,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 120 [2025-04-29 10:55:08,544 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 84 [2025-04-29 10:55:08,611 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:08,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 80 [2025-04-29 10:55:08,630 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2025-04-29 10:55:08,697 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 10:55:08,697 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 37 [2025-04-29 10:55:10,845 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:10,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223290974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 10:55:10,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 10:55:10,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-04-29 10:55:10,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798973590] [2025-04-29 10:55:10,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 10:55:10,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-29 10:55:10,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 10:55:10,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-29 10:55:10,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=456, Unknown=23, NotChecked=0, Total=552 [2025-04-29 10:55:10,847 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 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-04-29 10:55:15,416 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:55:19,435 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-04-29 10:55:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 10:55:22,554 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2025-04-29 10:55:22,555 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 10:55:22,555 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-29 10:55:22,555 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 10:55:22,555 INFO L225 Difference]: With dead ends: 55 [2025-04-29 10:55:22,555 INFO L226 Difference]: Without dead ends: 40 [2025-04-29 10:55:22,556 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=101, Invalid=630, Unknown=25, NotChecked=0, Total=756 [2025-04-29 10:55:22,557 INFO L437 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2025-04-29 10:55:22,557 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 247 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 255 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2025-04-29 10:55:22,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-29 10:55:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2025-04-29 10:55:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 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-04-29 10:55:22,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2025-04-29 10:55:22,559 INFO L79 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2025-04-29 10:55:22,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 10:55:22,560 INFO L485 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2025-04-29 10:55:22,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 24 states have internal predecessors, (71), 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-04-29 10:55:22,560 INFO L278 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2025-04-29 10:55:22,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-29 10:55:22,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 10:55:22,560 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2025-04-29 10:55:22,567 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-04-29 10:55:22,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:22,762 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-29 10:55:22,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 10:55:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 2140164200, now seen corresponding path program 6 times [2025-04-29 10:55:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 10:55:22,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063207652] [2025-04-29 10:55:22,762 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:55:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 10:55:22,771 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 5 equivalence classes. [2025-04-29 10:55:22,793 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:22,794 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 10:55:22,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 15 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 10:55:27,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 10:55:27,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063207652] [2025-04-29 10:55:27,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063207652] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 10:55:27,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637663879] [2025-04-29 10:55:27,001 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-29 10:55:27,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 10:55:27,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 10:55:27,003 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-04-29 10:55:27,004 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-04-29 10:55:27,048 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 36 statements into 5 equivalence classes. [2025-04-29 10:55:27,090 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 10:55:27,090 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-04-29 10:55:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 10:55:27,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-04-29 10:55:27,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 10:55:27,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-29 10:55:27,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-04-29 10:55:27,582 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 10:55:27,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-04-29 10:55:28,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-04-29 10:55:28,135 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 10:55:28,206 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-29 10:55:29,064 INFO L325 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-04-29 10:55:29,064 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-04-29 10:55:29,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:55:29,795 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2025-04-29 10:55:29,814 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2025-04-29 10:55:29,883 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 42 [2025-04-29 10:55:29,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2025-04-29 10:55:30,770 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:30,979 INFO L325 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-04-29 10:55:30,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-04-29 10:55:31,741 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-04-29 10:55:31,778 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 10:55:31,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2025-04-29 10:55:31,908 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 10:55:31,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 115 treesize of output 68 [2025-04-29 10:55:31,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2025-04-29 10:55:32,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 Killed by 15