./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/s4if.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/s4if.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 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:40:15,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:40:15,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:40:15,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:40:15,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:40:15,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:40:15,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:40:15,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:40:15,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:40:15,370 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:40:15,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:40:15,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:40:15,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:40:15,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:40:15,374 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:40:15,375 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:40:15,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:40:15,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:15,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:40:15,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:40:15,376 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 -> 5fe0a71bff946f0cc68d0dab1416e0ef991c6bf06ad7cbb70643ca18073a3c7e [2025-03-03 09:40:15,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:40:15,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:40:15,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:40:15,609 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:40:15,609 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:40:15,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/s4if.c [2025-03-03 09:40:16,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8eb1794/02a7c85c1f0240c9b5a1a6b3b9975bd7/FLAG3e144d0cc [2025-03-03 09:40:16,978 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:40:16,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c [2025-03-03 09:40:16,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8eb1794/02a7c85c1f0240c9b5a1a6b3b9975bd7/FLAG3e144d0cc [2025-03-03 09:40:17,307 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8eb1794/02a7c85c1f0240c9b5a1a6b3b9975bd7 [2025-03-03 09:40:17,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:40:17,311 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:40:17,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:17,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:40:17,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:40:17,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@87a86ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17, skipping insertion in model container [2025-03-03 09:40:17,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,329 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:40:17,434 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2025-03-03 09:40:17,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:17,457 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:40:17,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/s4if.c[587,600] [2025-03-03 09:40:17,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:40:17,477 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:40:17,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17 WrapperNode [2025-03-03 09:40:17,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:40:17,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:17,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:40:17,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:40:17,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,499 INFO L138 Inliner]: procedures = 17, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 73 [2025-03-03 09:40:17,499 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:40:17,500 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:40:17,500 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:40:17,500 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:40:17,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,506 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,514 INFO L175 MemorySlicer]: Split 19 memory accesses to 4 slices as follows [2, 7, 6, 4]. 37 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 4 writes are split as follows [0, 0, 3, 1]. [2025-03-03 09:40:17,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:40:17,523 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:40:17,523 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:40:17,523 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:40:17,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (1/1) ... [2025-03-03 09:40:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:40:17,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:17,552 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:40:17,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:40:17,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:40:17,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:40:17,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:40:17,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-03 09:40:17,572 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-03 09:40:17,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:40:17,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:40:17,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:40:17,752 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-03 09:40:17,759 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-03 09:40:17,760 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:40:17,765 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:40:17,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:40:17,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:17 BoogieIcfgContainer [2025-03-03 09:40:17,766 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:40:17,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:40:17,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:40:17,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:40:17,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:40:17" (1/3) ... [2025-03-03 09:40:17,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12318ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:17, skipping insertion in model container [2025-03-03 09:40:17,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:40:17" (2/3) ... [2025-03-03 09:40:17,772 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12318ee3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:40:17, skipping insertion in model container [2025-03-03 09:40:17,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:40:17" (3/3) ... [2025-03-03 09:40:17,773 INFO L128 eAbstractionObserver]: Analyzing ICFG s4if.c [2025-03-03 09:40:17,784 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:40:17,785 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG s4if.c that has 1 procedures, 16 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-03 09:40:17,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:40:17,842 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4023a502, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:40:17,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:40:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:40:17,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:17,851 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:17,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -673256721, now seen corresponding path program 1 times [2025-03-03 09:40:17,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:17,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763151874] [2025-03-03 09:40:17,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:17,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:40:17,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:40:17,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:17,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:17,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:17,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763151874] [2025-03-03 09:40:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763151874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:17,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:17,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:40:17,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473712886] [2025-03-03 09:40:17,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:17,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:40:17,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:18,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:40:18,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:40:18,007 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:18,015 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2025-03-03 09:40:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:40:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2025-03-03 09:40:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:18,023 INFO L225 Difference]: With dead ends: 28 [2025-03-03 09:40:18,023 INFO L226 Difference]: Without dead ends: 12 [2025-03-03 09:40:18,025 INFO L434 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-03-03 09:40:18,027 INFO L435 NwaCegarLoop]: 19 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, 19 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-03-03 09:40:18,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:18,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2025-03-03 09:40:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-03-03 09:40:18,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2025-03-03 09:40:18,047 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2025-03-03 09:40:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2025-03-03 09:40:18,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2025-03-03 09:40:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-03 09:40:18,047 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:18,048 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:18,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:40:18,048 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:18,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:18,048 INFO L85 PathProgramCache]: Analyzing trace with hash -644627570, now seen corresponding path program 1 times [2025-03-03 09:40:18,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:18,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508215863] [2025-03-03 09:40:18,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:18,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:18,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-03 09:40:18,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-03 09:40:18,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:18,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:18,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:18,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508215863] [2025-03-03 09:40:18,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508215863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:40:18,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:40:18,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:40:18,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933382072] [2025-03-03 09:40:18,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:40:18,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:40:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:18,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:40:18,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:40:18,196 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:18,236 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2025-03-03 09:40:18,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:40:18,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-03-03 09:40:18,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:18,237 INFO L225 Difference]: With dead ends: 22 [2025-03-03 09:40:18,237 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 09:40:18,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:40:18,238 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:18,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 9 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 09:40:18,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-03-03 09:40:18,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-03 09:40:18,242 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2025-03-03 09:40:18,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:18,242 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-03 09:40:18,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:18,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-03 09:40:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:40:18,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:18,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:18,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:40:18,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 380854543, now seen corresponding path program 1 times [2025-03-03 09:40:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47128971] [2025-03-03 09:40:18,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:18,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:40:18,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:40:18,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:18,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:18,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47128971] [2025-03-03 09:40:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47128971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:18,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602420228] [2025-03-03 09:40:18,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:18,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:18,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:18,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:18,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:40:18,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:40:18,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:40:18,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:18,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:18,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:40:18,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:18,894 INFO L378 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-03-03 09:40:19,012 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:19,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:19,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602420228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:19,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:19,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-03 09:40:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265451432] [2025-03-03 09:40:19,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:19,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 09:40:19,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:19,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 09:40:19,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:40:19,166 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:19,377 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2025-03-03 09:40:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:40:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 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 13 [2025-03-03 09:40:19,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:19,377 INFO L225 Difference]: With dead ends: 26 [2025-03-03 09:40:19,378 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:40:19,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:40:19,379 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:19,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 40 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:19,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:40:19,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2025-03-03 09:40:19,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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-03-03 09:40:19,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-03 09:40:19,382 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 13 [2025-03-03 09:40:19,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:19,382 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-03 09:40:19,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,382 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-03 09:40:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 09:40:19,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:19,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:19,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 09:40:19,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:19,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:19,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:19,583 INFO L85 PathProgramCache]: Analyzing trace with hash 381778064, now seen corresponding path program 1 times [2025-03-03 09:40:19,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:19,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585034090] [2025-03-03 09:40:19,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:19,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:40:19,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:40:19,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:19,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:19,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585034090] [2025-03-03 09:40:19,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585034090] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:19,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271001916] [2025-03-03 09:40:19,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:19,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:19,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:19,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:19,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:40:19,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 09:40:19,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 09:40:19,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:19,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:40:19,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:19,798 INFO L378 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-03-03 09:40:19,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:19,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:19,860 INFO L378 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 14 treesize of output 12 [2025-03-03 09:40:19,863 INFO L378 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 14 treesize of output 12 [2025-03-03 09:40:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:19,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271001916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:19,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:40:19,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037324352] [2025-03-03 09:40:19,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:19,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:40:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:19,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:40:19,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:40:19,874 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:19,912 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-03 09:40:19,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:40:19,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 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 13 [2025-03-03 09:40:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:19,914 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:40:19,914 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 09:40:19,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:19,914 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:19,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 30 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:19,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 09:40:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2025-03-03 09:40:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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-03-03 09:40:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-03 09:40:19,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 13 [2025-03-03 09:40:19,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:19,921 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-03 09:40:19,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:19,921 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-03 09:40:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:40:19,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:19,921 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:19,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:20,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-03 09:40:20,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:20,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:20,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1610116533, now seen corresponding path program 2 times [2025-03-03 09:40:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:20,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412186673] [2025-03-03 09:40:20,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:20,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:20,129 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 09:40:20,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:40:20,136 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:20,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412186673] [2025-03-03 09:40:20,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412186673] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:20,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589863891] [2025-03-03 09:40:20,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:20,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:20,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:40:20,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 09:40:20,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:40:20,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:20,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:20,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589863891] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:20,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:20,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:40:20,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067181484] [2025-03-03 09:40:20,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:20,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:40:20,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:20,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:40:20,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:20,316 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-03-03 09:40:20,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:20,416 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2025-03-03 09:40:20,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:20,417 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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) Word has length 14 [2025-03-03 09:40:20,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:20,417 INFO L225 Difference]: With dead ends: 27 [2025-03-03 09:40:20,417 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:40:20,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:20,418 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:20,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 27 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:20,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:40:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 17. [2025-03-03 09:40:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-03-03 09:40:20,424 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2025-03-03 09:40:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:20,424 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-03-03 09:40:20,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-03-03 09:40:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2025-03-03 09:40:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 09:40:20,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:20,424 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:20,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:40:20,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:20,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:20,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1147567788, now seen corresponding path program 3 times [2025-03-03 09:40:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:20,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392523330] [2025-03-03 09:40:20,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:20,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:20,631 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-03 09:40:20,646 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:20,646 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:20,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392523330] [2025-03-03 09:40:20,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392523330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:20,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711694030] [2025-03-03 09:40:20,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:20,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:20,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:20,702 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:20,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:40:20,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 3 equivalence classes. [2025-03-03 09:40:20,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 09:40:20,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:20,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:20,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:40:20,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:20,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711694030] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:20,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:20,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-03-03 09:40:20,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766291353] [2025-03-03 09:40:20,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:20,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 09:40:20,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:20,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 09:40:20,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:40:20,813 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:20,858 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-03 09:40:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:40:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 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 16 [2025-03-03 09:40:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:20,858 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:40:20,858 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:40:20,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:40:20,859 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:20,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:20,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:40:20,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-03 09:40:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 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-03-03 09:40:20,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2025-03-03 09:40:20,865 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2025-03-03 09:40:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:20,865 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2025-03-03 09:40:20,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:20,866 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2025-03-03 09:40:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:40:20,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:20,867 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:20,873 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-03-03 09:40:21,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:21,067 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 905210606, now seen corresponding path program 4 times [2025-03-03 09:40:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:21,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488190768] [2025-03-03 09:40:21,068 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:21,073 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:40:21,090 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:21,090 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:21,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488190768] [2025-03-03 09:40:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488190768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835586556] [2025-03-03 09:40:21,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:21,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:21,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:21,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:21,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:40:21,438 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-03 09:40:21,450 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:21,451 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:21,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:21,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 09:40:21,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:21,457 INFO L378 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-03-03 09:40:21,518 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:21,639 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:21,649 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:40:21,649 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2025-03-03 09:40:21,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:21,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:21,835 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:40:21,835 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 9 [2025-03-03 09:40:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:21,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835586556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:21,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:21,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-03 09:40:21,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292042612] [2025-03-03 09:40:21,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 09:40:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:21,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 09:40:21,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-03-03 09:40:21,987 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:22,802 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2025-03-03 09:40:22,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 09:40:22,802 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 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 17 [2025-03-03 09:40:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:22,804 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:40:22,804 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 09:40:22,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=282, Invalid=1524, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:40:22,805 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:22,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 55 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:40:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 09:40:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2025-03-03 09:40:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 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-03-03 09:40:22,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-03 09:40:22,813 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2025-03-03 09:40:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:22,813 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-03 09:40:22,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:22,813 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-03 09:40:22,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-03 09:40:22,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:22,813 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:22,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:23,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:23,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:23,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:23,018 INFO L85 PathProgramCache]: Analyzing trace with hash 906134127, now seen corresponding path program 1 times [2025-03-03 09:40:23,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:23,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411165029] [2025-03-03 09:40:23,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:23,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:23,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:23,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:23,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:23,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411165029] [2025-03-03 09:40:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411165029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:23,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849072944] [2025-03-03 09:40:23,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:40:23,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:23,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:23,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:23,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:40:23,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-03 09:40:23,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-03 09:40:23,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:23,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 09:40:23,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:23,262 INFO L378 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-03-03 09:40:23,302 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:23,336 INFO L378 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 16 treesize of output 14 [2025-03-03 09:40:23,338 INFO L378 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 16 treesize of output 12 [2025-03-03 09:40:23,353 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849072944] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:23,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-03 09:40:23,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931973890] [2025-03-03 09:40:23,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:23,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:40:23,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:23,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:40:23,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:40:23,354 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:23,418 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2025-03-03 09:40:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:40:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 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 17 [2025-03-03 09:40:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:23,419 INFO L225 Difference]: With dead ends: 56 [2025-03-03 09:40:23,419 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 09:40:23,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:23,420 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:23,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 55 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:40:23,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 09:40:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-03-03 09:40:23,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-03 09:40:23,425 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 17 [2025-03-03 09:40:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:23,425 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-03 09:40:23,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-03 09:40:23,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 09:40:23,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:23,426 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:23,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:40:23,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:23,627 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:23,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:23,627 INFO L85 PathProgramCache]: Analyzing trace with hash 116831380, now seen corresponding path program 5 times [2025-03-03 09:40:23,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:23,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302411784] [2025-03-03 09:40:23,627 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:23,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:23,632 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-03 09:40:23,637 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:40:23,637 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:40:23,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302411784] [2025-03-03 09:40:23,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302411784] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:23,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005598288] [2025-03-03 09:40:23,693 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:23,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:23,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:23,695 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:23,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:40:23,731 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 3 equivalence classes. [2025-03-03 09:40:23,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 09:40:23,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-03 09:40:23,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:23,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:23,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:23,786 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:23,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:23,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005598288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:23,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:23,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-03 09:40:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453740957] [2025-03-03 09:40:23,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:23,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:40:23,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:23,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:40:23,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:40:23,823 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:23,928 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2025-03-03 09:40:23,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:40:23,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 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 18 [2025-03-03 09:40:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:23,929 INFO L225 Difference]: With dead ends: 47 [2025-03-03 09:40:23,929 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 09:40:23,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:40:23,929 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:23,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 09:40:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2025-03-03 09:40:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-03 09:40:23,934 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 18 [2025-03-03 09:40:23,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:23,934 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-03 09:40:23,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:23,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-03 09:40:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 09:40:23,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:23,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:23,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:24,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:24,135 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:24,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:24,136 INFO L85 PathProgramCache]: Analyzing trace with hash -851226986, now seen corresponding path program 2 times [2025-03-03 09:40:24,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:24,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701004344] [2025-03-03 09:40:24,136 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:24,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:24,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:24,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:24,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701004344] [2025-03-03 09:40:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701004344] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30252610] [2025-03-03 09:40:24,198 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:24,200 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:24,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:40:24,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-03-03 09:40:24,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 09:40:24,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:24,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:24,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:40:24,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:24,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:24,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:24,333 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30252610] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:24,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 09:40:24,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169339924] [2025-03-03 09:40:24,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:24,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:40:24,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:24,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:40:24,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:40:24,334 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:24,410 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2025-03-03 09:40:24,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:40:24,411 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 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-03-03 09:40:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:24,411 INFO L225 Difference]: With dead ends: 50 [2025-03-03 09:40:24,411 INFO L226 Difference]: Without dead ends: 24 [2025-03-03 09:40:24,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:40:24,412 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:24,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 33 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-03 09:40:24,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2025-03-03 09:40:24,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2025-03-03 09:40:24,414 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2025-03-03 09:40:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:24,414 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2025-03-03 09:40:24,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2025-03-03 09:40:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:40:24,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:24,415 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:24,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:24,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:40:24,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:24,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:24,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1718469551, now seen corresponding path program 6 times [2025-03-03 09:40:24,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:24,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532195817] [2025-03-03 09:40:24,616 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:24,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:24,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:40:24,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:40:24,636 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:40:24,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:25,002 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:25,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532195817] [2025-03-03 09:40:25,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532195817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:25,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774692718] [2025-03-03 09:40:25,002 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:25,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:25,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:25,004 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:25,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:40:25,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:40:25,061 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 09:40:25,061 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-03 09:40:25,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:25,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 09:40:25,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:25,070 INFO L378 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-03-03 09:40:25,188 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:25,293 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:25,450 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:25,458 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-03 09:40:25,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 10 [2025-03-03 09:40:25,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:25,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:26,025 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-03 09:40:26,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 37 treesize of output 13 [2025-03-03 09:40:26,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:26,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774692718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:26,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:26,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2025-03-03 09:40:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088631863] [2025-03-03 09:40:26,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:26,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 09:40:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:26,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 09:40:26,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1776, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:40:26,196 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:26,957 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2025-03-03 09:40:26,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:40:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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 21 [2025-03-03 09:40:26,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:26,958 INFO L225 Difference]: With dead ends: 43 [2025-03-03 09:40:26,958 INFO L226 Difference]: Without dead ends: 40 [2025-03-03 09:40:26,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=397, Invalid=3143, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 09:40:26,959 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:26,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:40:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-03 09:40:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-03-03 09:40:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2025-03-03 09:40:26,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2025-03-03 09:40:26,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:26,966 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2025-03-03 09:40:26,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:26,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2025-03-03 09:40:26,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 09:40:26,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:26,966 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:26,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:27,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:27,167 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:27,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1719393072, now seen corresponding path program 3 times [2025-03-03 09:40:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436208218] [2025-03-03 09:40:27,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:27,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:40:27,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-03 09:40:27,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:27,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 09:40:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436208218] [2025-03-03 09:40:27,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436208218] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:27,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840135386] [2025-03-03 09:40:27,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:27,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:27,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:27,374 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:27,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:40:27,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 4 equivalence classes. [2025-03-03 09:40:27,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 18 of 21 statements. [2025-03-03 09:40:27,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:40:27,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:27,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-03 09:40:27,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:27,438 INFO L378 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 11 [2025-03-03 09:40:27,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:27,490 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-03-03 09:40:27,520 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:40:27,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:40:27,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840135386] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:27,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:27,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 16 [2025-03-03 09:40:27,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136997585] [2025-03-03 09:40:27,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:27,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:40:27,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:27,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:40:27,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:40:27,583 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:27,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:27,913 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-03 09:40:27,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:40:27,913 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 21 [2025-03-03 09:40:27,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:27,915 INFO L225 Difference]: With dead ends: 52 [2025-03-03 09:40:27,915 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 09:40:27,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:40:27,915 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 44 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:27,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 42 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 09:40:27,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2025-03-03 09:40:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 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-03-03 09:40:27,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-03 09:40:27,925 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2025-03-03 09:40:27,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:27,926 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-03 09:40:27,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:27,926 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-03 09:40:27,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:40:27,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:27,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:27,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:28,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:40:28,127 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:28,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -965436748, now seen corresponding path program 7 times [2025-03-03 09:40:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:28,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561440766] [2025-03-03 09:40:28,128 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:28,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:28,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:28,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:28,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561440766] [2025-03-03 09:40:28,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561440766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:28,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980186224] [2025-03-03 09:40:28,199 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:28,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:28,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:28,201 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:28,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:40:28,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:40:28,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:40:28,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:28,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:28,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 09:40:28,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:28,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:28,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:28,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980186224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:28,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-03-03 09:40:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371271253] [2025-03-03 09:40:28,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:28,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-03 09:40:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:28,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-03 09:40:28,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-03-03 09:40:28,356 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:28,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:28,438 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-03 09:40:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:40:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 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 24 [2025-03-03 09:40:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:28,439 INFO L225 Difference]: With dead ends: 49 [2025-03-03 09:40:28,439 INFO L226 Difference]: Without dead ends: 31 [2025-03-03 09:40:28,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-03-03 09:40:28,440 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 22 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:28,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-03 09:40:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2025-03-03 09:40:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:28,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-03 09:40:28,446 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-03 09:40:28,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:28,446 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-03 09:40:28,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5625) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:28,446 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-03 09:40:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:40:28,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:28,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:28,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:40:28,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:40:28,647 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:28,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:28,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1056880050, now seen corresponding path program 8 times [2025-03-03 09:40:28,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:28,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157770610] [2025-03-03 09:40:28,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:28,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:40:28,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:40:28,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:28,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:29,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157770610] [2025-03-03 09:40:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157770610] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321270878] [2025-03-03 09:40:29,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:29,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:29,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:29,100 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:29,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:40:29,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:40:29,157 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:40:29,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:29,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:29,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-03 09:40:29,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:29,168 INFO L378 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-03-03 09:40:29,222 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:29,290 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:29,370 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:29,456 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:29,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321270878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:29,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:29,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 17] total 43 [2025-03-03 09:40:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62686087] [2025-03-03 09:40:29,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:29,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 09:40:29,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:29,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 09:40:29,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:40:29,944 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:30,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:30,521 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-03 09:40:30,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-03 09:40:30,521 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 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 25 [2025-03-03 09:40:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:30,522 INFO L225 Difference]: With dead ends: 47 [2025-03-03 09:40:30,522 INFO L226 Difference]: Without dead ends: 44 [2025-03-03 09:40:30,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2025-03-03 09:40:30,523 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:30,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:40:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-03 09:40:30,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2025-03-03 09:40:30,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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-03-03 09:40:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-03 09:40:30,530 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-03 09:40:30,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:30,530 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-03 09:40:30,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:30,530 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-03 09:40:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:40:30,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:30,531 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:30,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:30,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:40:30,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:30,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 685930285, now seen corresponding path program 4 times [2025-03-03 09:40:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:30,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249829769] [2025-03-03 09:40:30,732 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:30,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:30,738 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:40:30,744 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-03 09:40:30,744 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:30,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:40:30,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249829769] [2025-03-03 09:40:30,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249829769] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:30,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038919582] [2025-03-03 09:40:30,877 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:30,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:30,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:30,880 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:30,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:40:30,921 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-03-03 09:40:30,928 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 25 statements. [2025-03-03 09:40:30,928 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:40:30,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:30,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 09:40:30,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:30,934 INFO L378 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 16 treesize of output 12 [2025-03-03 09:40:30,943 INFO L378 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 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-03 09:40:30,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:30,977 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2025-03-03 09:40:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:40:31,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:31,059 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:40:31,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038919582] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:31,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:31,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 13 [2025-03-03 09:40:31,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593261628] [2025-03-03 09:40:31,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:31,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:40:31,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:31,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:40:31,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:40:31,060 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:31,223 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-03 09:40:31,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:40:31,223 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 25 [2025-03-03 09:40:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:31,223 INFO L225 Difference]: With dead ends: 45 [2025-03-03 09:40:31,223 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 09:40:31,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:40:31,224 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:31,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:31,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 09:40:31,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2025-03-03 09:40:31,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 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-03-03 09:40:31,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2025-03-03 09:40:31,235 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2025-03-03 09:40:31,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:31,235 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2025-03-03 09:40:31,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:31,235 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2025-03-03 09:40:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-03 09:40:31,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:31,235 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:31,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:31,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:40:31,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:31,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 403344884, now seen corresponding path program 9 times [2025-03-03 09:40:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493165162] [2025-03-03 09:40:31,436 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:31,443 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-03 09:40:31,466 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:40:31,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:40:31,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:31,567 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493165162] [2025-03-03 09:40:31,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493165162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:31,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727340154] [2025-03-03 09:40:31,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:40:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:31,570 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:31,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:40:31,621 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 5 equivalence classes. [2025-03-03 09:40:31,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 26 of 26 statements. [2025-03-03 09:40:31,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-03 09:40:31,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:31,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:40:31,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:31,742 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:31,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727340154] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:31,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:31,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 20 [2025-03-03 09:40:31,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129354195] [2025-03-03 09:40:31,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:31,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:40:31,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:31,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:40:31,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:40:31,809 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:31,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:31,978 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2025-03-03 09:40:31,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 09:40:31,978 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 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 26 [2025-03-03 09:40:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:31,979 INFO L225 Difference]: With dead ends: 65 [2025-03-03 09:40:31,979 INFO L226 Difference]: Without dead ends: 62 [2025-03-03 09:40:31,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 35 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2025-03-03 09:40:31,979 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:31,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 31 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:31,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-03 09:40:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 29. [2025-03-03 09:40:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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-03-03 09:40:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-03 09:40:31,986 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 26 [2025-03-03 09:40:31,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:31,986 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-03 09:40:31,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:31,986 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-03 09:40:31,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:40:31,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:31,986 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:31,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:32,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:32,187 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:32,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:32,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1010015157, now seen corresponding path program 10 times [2025-03-03 09:40:32,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:32,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424202325] [2025-03-03 09:40:32,187 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:32,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:32,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:40:32,196 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:40:32,196 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:32,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:32,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:32,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424202325] [2025-03-03 09:40:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424202325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359640130] [2025-03-03 09:40:32,278 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:40:32,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:32,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:32,280 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:32,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:40:32,329 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-03-03 09:40:32,349 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:40:32,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:40:32,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:32,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:40:32,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:32,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:32,489 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:32,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359640130] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:32,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:32,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2025-03-03 09:40:32,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915638391] [2025-03-03 09:40:32,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:32,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:40:32,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:32,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:40:32,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:40:32,491 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:32,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:32,585 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2025-03-03 09:40:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:40:32,586 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 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-03-03 09:40:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:32,586 INFO L225 Difference]: With dead ends: 68 [2025-03-03 09:40:32,586 INFO L226 Difference]: Without dead ends: 42 [2025-03-03 09:40:32,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:40:32,587 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:32,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 40 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-03 09:40:32,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2025-03-03 09:40:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:32,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-03 09:40:32,595 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2025-03-03 09:40:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:32,596 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-03 09:40:32,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:32,596 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-03 09:40:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:40:32,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:32,596 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:32,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-03 09:40:32,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:40:32,800 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:32,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:32,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1152717233, now seen corresponding path program 11 times [2025-03-03 09:40:32,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:32,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350946877] [2025-03-03 09:40:32,800 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:32,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:32,805 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-03 09:40:32,819 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:40:32,819 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:40:32,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:33,205 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:40:33,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:33,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350946877] [2025-03-03 09:40:33,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350946877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:33,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561163328] [2025-03-03 09:40:33,206 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:33,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:33,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:33,208 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:33,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:40:33,257 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-03 09:40:33,284 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:40:33,284 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:40:33,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:33,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-03 09:40:33,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:33,292 INFO L378 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-03-03 09:40:33,443 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:33,538 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:33,699 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:33,875 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,070 INFO L378 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 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-03 09:40:34,080 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-03 09:40:34,080 INFO L378 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 56 treesize of output 16 [2025-03-03 09:40:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:34,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:35,105 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-03-03 09:40:35,106 INFO L378 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 61 treesize of output 21 [2025-03-03 09:40:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:35,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561163328] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:35,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:35,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 24, 24] total 59 [2025-03-03 09:40:35,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607658868] [2025-03-03 09:40:35,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:35,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-03-03 09:40:35,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:35,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-03-03 09:40:35,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=3096, Unknown=0, NotChecked=0, Total=3422 [2025-03-03 09:40:35,463 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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-03-03 09:40:43,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:43,838 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2025-03-03 09:40:43,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-03-03 09:40:43,839 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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 29 [2025-03-03 09:40:43,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:43,839 INFO L225 Difference]: With dead ends: 131 [2025-03-03 09:40:43,839 INFO L226 Difference]: Without dead ends: 117 [2025-03-03 09:40:43,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5675 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=1985, Invalid=15837, Unknown=0, NotChecked=0, Total=17822 [2025-03-03 09:40:43,843 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 69 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:43,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 131 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 09:40:43,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-03 09:40:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 64. [2025-03-03 09:40:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:43,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 79 transitions. [2025-03-03 09:40:43,860 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 79 transitions. Word has length 29 [2025-03-03 09:40:43,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:43,860 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 79 transitions. [2025-03-03 09:40:43,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 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-03-03 09:40:43,860 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2025-03-03 09:40:43,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:40:43,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:43,861 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:43,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:44,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:40:44,063 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:44,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:44,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1345298704, now seen corresponding path program 5 times [2025-03-03 09:40:44,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908468681] [2025-03-03 09:40:44,063 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:44,068 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-03 09:40:44,077 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:40:44,078 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:40:44,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:40:44,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908468681] [2025-03-03 09:40:44,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908468681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:44,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046233274] [2025-03-03 09:40:44,251 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:40:44,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:44,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:44,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:44,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:40:44,307 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 6 equivalence classes. [2025-03-03 09:40:44,352 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:40:44,352 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-03 09:40:44,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:44,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-03 09:40:44,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:44,393 INFO L378 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-03-03 09:40:44,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:44,413 INFO L378 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 20 [2025-03-03 09:40:44,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:44,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:44,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:44,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:44,451 INFO L378 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 1 case distinctions, treesize of input 36 treesize of output 23 [2025-03-03 09:40:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:40:44,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:44,648 INFO L378 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 25 [2025-03-03 09:40:44,651 INFO L378 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 29 treesize of output 25 [2025-03-03 09:40:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 09:40:44,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046233274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:44,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:44,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 22 [2025-03-03 09:40:44,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701278655] [2025-03-03 09:40:44,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:44,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 09:40:44,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:44,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 09:40:44,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-03-03 09:40:44,662 INFO L87 Difference]: Start difference. First operand 64 states and 79 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:44,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:44,822 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2025-03-03 09:40:44,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 09:40:44,823 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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 29 [2025-03-03 09:40:44,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:44,823 INFO L225 Difference]: With dead ends: 111 [2025-03-03 09:40:44,823 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 09:40:44,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:40:44,824 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:44,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 69 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 09:40:44,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-03 09:40:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:44,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2025-03-03 09:40:44,845 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 29 [2025-03-03 09:40:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:44,846 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2025-03-03 09:40:44,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2025-03-03 09:40:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:40:44,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:44,846 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:44,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-03 09:40:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:45,047 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1202383761, now seen corresponding path program 6 times [2025-03-03 09:40:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311214848] [2025-03-03 09:40:45,047 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:45,053 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-03 09:40:45,080 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:40:45,081 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:40:45,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 17 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:45,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311214848] [2025-03-03 09:40:45,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311214848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:45,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [870385732] [2025-03-03 09:40:45,796 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:40:45,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:45,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:45,798 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:45,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:40:45,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 33 statements into 7 equivalence classes. [2025-03-03 09:40:45,902 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:40:45,902 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:40:45,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:45,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 09:40:45,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:45,988 INFO L378 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-03-03 09:40:46,016 INFO L378 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 23 treesize of output 11 [2025-03-03 09:40:46,045 INFO L378 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 23 treesize of output 11 [2025-03-03 09:40:46,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:40:46,147 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:40:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:40:46,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 09:40:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [870385732] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:46,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:46,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16, 12] total 47 [2025-03-03 09:40:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010220146] [2025-03-03 09:40:46,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-03 09:40:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:46,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-03 09:40:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 09:40:46,610 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:48,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:48,394 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2025-03-03 09:40:48,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-03 09:40:48,395 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 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 33 [2025-03-03 09:40:48,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:48,395 INFO L225 Difference]: With dead ends: 210 [2025-03-03 09:40:48,395 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 09:40:48,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2502 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1180, Invalid=9740, Unknown=0, NotChecked=0, Total=10920 [2025-03-03 09:40:48,397 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 97 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:48,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 100 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:40:48,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 09:40:48,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2025-03-03 09:40:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 88 transitions. [2025-03-03 09:40:48,421 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 88 transitions. Word has length 33 [2025-03-03 09:40:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:48,421 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 88 transitions. [2025-03-03 09:40:48,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.553191489361702) internal successors, (73), 47 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 88 transitions. [2025-03-03 09:40:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-03 09:40:48,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:48,422 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:48,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:48,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:48,626 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1071070995, now seen corresponding path program 7 times [2025-03-03 09:40:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052413140] [2025-03-03 09:40:48,626 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:48,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:40:48,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:40:48,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:48,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 73 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052413140] [2025-03-03 09:40:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052413140] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484922173] [2025-03-03 09:40:48,788 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:40:48,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:48,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:48,789 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:48,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:40:48,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-03 09:40:48,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-03 09:40:48,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:40:48,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:48,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 09:40:48,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:49,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:40:49,112 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 92 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:49,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484922173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:40:49,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:40:49,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 28 [2025-03-03 09:40:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792404494] [2025-03-03 09:40:49,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:40:49,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 09:40:49,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:40:49,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 09:40:49,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:40:49,113 INFO L87 Difference]: Start difference. First operand 75 states and 88 transitions. Second operand has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:40:49,325 INFO L93 Difference]: Finished difference Result 170 states and 204 transitions. [2025-03-03 09:40:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:40:49,326 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 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 40 [2025-03-03 09:40:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:40:49,326 INFO L225 Difference]: With dead ends: 170 [2025-03-03 09:40:49,326 INFO L226 Difference]: Without dead ends: 77 [2025-03-03 09:40:49,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 56 SyntacticMatches, 14 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=1230, Unknown=0, NotChecked=0, Total=1640 [2025-03-03 09:40:49,327 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:40:49,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 40 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:40:49,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-03 09:40:49,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 42. [2025-03-03 09:40:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-03-03 09:40:49,337 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 40 [2025-03-03 09:40:49,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:40:49,337 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-03-03 09:40:49,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 28 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:40:49,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-03-03 09:40:49,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:40:49,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:40:49,338 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:40:49,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-03 09:40:49,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:49,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:40:49,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:40:49,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1196784301, now seen corresponding path program 8 times [2025-03-03 09:40:49,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:40:49,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631970249] [2025-03-03 09:40:49,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:49,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:40:49,546 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:40:49,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:40:49,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:49,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 21 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:40:50,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:40:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631970249] [2025-03-03 09:40:50,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631970249] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:40:50,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098602559] [2025-03-03 09:40:50,051 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:40:50,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:40:50,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:40:50,053 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:40:50,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-03 09:40:50,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-03 09:40:50,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-03 09:40:50,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:40:50,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:40:50,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 09:40:50,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:40:50,186 INFO L378 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-03-03 09:40:50,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:50,211 INFO L378 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 27 treesize of output 11 [2025-03-03 09:40:50,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:50,242 INFO L378 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 27 treesize of output 11 [2025-03-03 09:40:50,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:40:50,278 INFO L378 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 27 treesize of output 11 [2025-03-03 09:40:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 54 proven. 59 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:40:50,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:23,359 INFO L378 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 37 treesize of output 35 [2025-03-03 09:41:23,362 INFO L378 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 3318 treesize of output 3254 [2025-03-03 09:41:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 52 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:41:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098602559] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:23,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 17] total 51 [2025-03-03 09:41:23,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561940408] [2025-03-03 09:41:23,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-03 09:41:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:23,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-03 09:41:23,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2267, Unknown=8, NotChecked=0, Total=2550 [2025-03-03 09:41:23,511 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:24,038 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2025-03-03 09:41:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:41:24,039 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 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 41 [2025-03-03 09:41:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:24,039 INFO L225 Difference]: With dead ends: 74 [2025-03-03 09:41:24,039 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 09:41:24,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=494, Invalid=3280, Unknown=8, NotChecked=0, Total=3782 [2025-03-03 09:41:24,041 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 111 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:24,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 118 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:41:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 09:41:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2025-03-03 09:41:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-03 09:41:24,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 41 [2025-03-03 09:41:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:24,052 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-03 09:41:24,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 51 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-03 09:41:24,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:41:24,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:24,052 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:24,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-03 09:41:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 09:41:24,253 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash -862943596, now seen corresponding path program 9 times [2025-03-03 09:41:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734770938] [2025-03-03 09:41:24,253 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:24,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:24,259 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 10 equivalence classes. [2025-03-03 09:41:24,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 44 statements. [2025-03-03 09:41:24,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:41:24,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 20 proven. 88 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:41:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734770938] [2025-03-03 09:41:24,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734770938] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:24,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562743937] [2025-03-03 09:41:24,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:41:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:24,533 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:24,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-03 09:41:24,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 10 equivalence classes. [2025-03-03 09:41:24,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 35 of 44 statements. [2025-03-03 09:41:24,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-03 09:41:24,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:24,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-03 09:41:24,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:24,733 INFO L378 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-03-03 09:41:24,753 INFO L378 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 23 treesize of output 11 [2025-03-03 09:41:24,774 INFO L378 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 23 treesize of output 11 [2025-03-03 09:41:24,797 INFO L378 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 23 treesize of output 11 [2025-03-03 09:41:24,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:24,887 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2025-03-03 09:41:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 09:41:25,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 20 proven. 88 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-03-03 09:41:25,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562743937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:25,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:25,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 14] total 32 [2025-03-03 09:41:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885368763] [2025-03-03 09:41:25,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:25,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 09:41:25,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:25,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 09:41:25,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2025-03-03 09:41:25,107 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:27,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:27,041 INFO L93 Difference]: Finished difference Result 194 states and 234 transitions. [2025-03-03 09:41:27,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-03 09:41:27,042 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 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 44 [2025-03-03 09:41:27,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:27,042 INFO L225 Difference]: With dead ends: 194 [2025-03-03 09:41:27,043 INFO L226 Difference]: Without dead ends: 191 [2025-03-03 09:41:27,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3927 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2273, Invalid=10837, Unknown=0, NotChecked=0, Total=13110 [2025-03-03 09:41:27,044 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 131 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:27,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 128 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:41:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-03 09:41:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 81. [2025-03-03 09:41:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.175) internal successors, (94), 80 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 94 transitions. [2025-03-03 09:41:27,068 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 94 transitions. Word has length 44 [2025-03-03 09:41:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:27,068 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 94 transitions. [2025-03-03 09:41:27,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.78125) internal successors, (57), 32 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 94 transitions. [2025-03-03 09:41:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 09:41:27,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:27,068 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:27,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-03 09:41:27,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-03 09:41:27,269 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:27,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash -13036331, now seen corresponding path program 10 times [2025-03-03 09:41:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117148892] [2025-03-03 09:41:27,269 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:27,277 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-03 09:41:27,284 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 48 statements. [2025-03-03 09:41:27,284 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:41:27,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 125 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-03 09:41:27,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117148892] [2025-03-03 09:41:27,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117148892] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:27,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602882889] [2025-03-03 09:41:27,588 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:41:27,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:27,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:27,594 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:27,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-03 09:41:27,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 48 statements into 2 equivalence classes. [2025-03-03 09:41:27,683 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 44 of 48 statements. [2025-03-03 09:41:27,684 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-03 09:41:27,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:27,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-03 09:41:27,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:27,690 INFO L378 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 16 treesize of output 12 [2025-03-03 09:41:27,695 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-03 09:41:27,699 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-03 09:41:27,702 INFO L378 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 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-03 09:41:27,707 INFO L378 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 0 case distinctions, treesize of input 36 treesize of output 16 [2025-03-03 09:41:27,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:41:27,884 INFO L378 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 15 [2025-03-03 09:41:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:28,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 25 proven. 155 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 09:41:28,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602882889] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:28,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:28,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21, 21] total 42 [2025-03-03 09:41:28,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699744684] [2025-03-03 09:41:28,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:28,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 09:41:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:28,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 09:41:28,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=1499, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 09:41:28,383 INFO L87 Difference]: Start difference. First operand 81 states and 94 transitions. Second operand has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:45,939 INFO L93 Difference]: Finished difference Result 620 states and 761 transitions. [2025-03-03 09:41:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 393 states. [2025-03-03 09:41:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 09:41:45,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:45,941 INFO L225 Difference]: With dead ends: 620 [2025-03-03 09:41:45,941 INFO L226 Difference]: Without dead ends: 617 [2025-03-03 09:41:45,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75819 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=20303, Invalid=164167, Unknown=0, NotChecked=0, Total=184470 [2025-03-03 09:41:45,948 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 3942 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:45,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 82 Invalid, 3996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3942 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 09:41:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-03 09:41:45,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 78. [2025-03-03 09:41:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 77 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 90 transitions. [2025-03-03 09:41:45,977 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 90 transitions. Word has length 48 [2025-03-03 09:41:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:45,977 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 90 transitions. [2025-03-03 09:41:45,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 42 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:45,977 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 90 transitions. [2025-03-03 09:41:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-03 09:41:45,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:45,977 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:45,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-03 09:41:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:46,178 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:46,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1699942450, now seen corresponding path program 11 times [2025-03-03 09:41:46,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:46,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388337649] [2025-03-03 09:41:46,178 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:46,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:46,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 12 equivalence classes. [2025-03-03 09:41:46,198 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:41:46,198 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-03 09:41:46,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:46,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388337649] [2025-03-03 09:41:46,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388337649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440953763] [2025-03-03 09:41:46,454 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:41:46,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:46,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:46,456 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:46,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-03 09:41:46,531 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 12 equivalence classes. [2025-03-03 09:41:47,383 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) and asserted 51 of 51 statements. [2025-03-03 09:41:47,383 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2025-03-03 09:41:47,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:47,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-03 09:41:47,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:41:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:47,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:41:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 176 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440953763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:41:47,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:41:47,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2025-03-03 09:41:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091628966] [2025-03-03 09:41:47,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:41:47,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 09:41:47,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:41:47,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 09:41:47,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=938, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:41:47,816 INFO L87 Difference]: Start difference. First operand 78 states and 90 transitions. Second operand has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:48,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:41:48,351 INFO L93 Difference]: Finished difference Result 305 states and 372 transitions. [2025-03-03 09:41:48,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 09:41:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 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 51 [2025-03-03 09:41:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:41:48,352 INFO L225 Difference]: With dead ends: 305 [2025-03-03 09:41:48,352 INFO L226 Difference]: Without dead ends: 124 [2025-03-03 09:41:48,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 71 SyntacticMatches, 18 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=926, Invalid=3364, Unknown=0, NotChecked=0, Total=4290 [2025-03-03 09:41:48,353 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:41:48,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 45 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:41:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-03-03 09:41:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 54. [2025-03-03 09:41:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-03 09:41:48,385 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 51 [2025-03-03 09:41:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:41:48,385 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-03 09:41:48,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.5555555555555554) internal successors, (92), 36 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:41:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-03 09:41:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:41:48,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:41:48,386 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:41:48,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-03 09:41:48,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:48,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:41:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:41:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1841761138, now seen corresponding path program 12 times [2025-03-03 09:41:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:41:48,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873727637] [2025-03-03 09:41:48,587 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:48,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:41:48,596 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 12 equivalence classes. [2025-03-03 09:41:48,632 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:41:48,632 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-03 09:41:48,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:41:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:41:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873727637] [2025-03-03 09:41:50,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873727637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:41:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868941464] [2025-03-03 09:41:50,297 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:41:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:41:50,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:41:50,298 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:41:50,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-03 09:41:50,374 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 53 statements into 12 equivalence classes. [2025-03-03 09:41:51,666 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:41:51,666 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-03 09:41:51,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:41:51,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 69 conjuncts are in the unsatisfiable core [2025-03-03 09:41:51,671 INFO L279 TraceCheckSpWp]: Computing forward predicates...