./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array3_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array3_pattern.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 8c9f77a5f5cfb41429e6b2e557580f5f8a855ca718c241fb5a07541ef3b21ab2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:39:45,499 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:39:45,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:39:45,558 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:39:45,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:39:45,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:39:45,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:39:45,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:39:45,575 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:39:45,575 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:39:45,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:39:45,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:39:45,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:39:45,576 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:39:45,576 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:39:45,577 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:39:45,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:39:45,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:39:45,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:39:45,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:39:45,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:39:45,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:39:45,578 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 -> 8c9f77a5f5cfb41429e6b2e557580f5f8a855ca718c241fb5a07541ef3b21ab2 [2025-03-08 00:39:45,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:39:45,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:39:45,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:39:45,806 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:39:45,806 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:39:45,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array3_pattern.c [2025-03-08 00:39:46,937 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2886df52/75e78f39256945ada8c727f0ce811c59/FLAG5acf0f89c [2025-03-08 00:39:47,161 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:39:47,165 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array3_pattern.c [2025-03-08 00:39:47,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2886df52/75e78f39256945ada8c727f0ce811c59/FLAG5acf0f89c [2025-03-08 00:39:47,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2886df52/75e78f39256945ada8c727f0ce811c59 [2025-03-08 00:39:47,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:39:47,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:39:47,492 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:39:47,492 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:39:47,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:39:47,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ece1e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47, skipping insertion in model container [2025-03-08 00:39:47,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:39:47,600 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-patterns/array3_pattern.c[1393,1406] [2025-03-08 00:39:47,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:39:47,622 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:39:47,628 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-patterns/array3_pattern.c[1393,1406] [2025-03-08 00:39:47,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:39:47,645 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:39:47,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47 WrapperNode [2025-03-08 00:39:47,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:39:47,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:39:47,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:39:47,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:39:47,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,667 INFO L138 Inliner]: procedures = 17, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2025-03-08 00:39:47,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:39:47,667 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:39:47,667 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:39:47,667 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:39:47,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,676 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,687 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-08 00:39:47,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,699 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:39:47,700 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:39:47,700 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:39:47,700 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:39:47,700 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (1/1) ... [2025-03-08 00:39:47,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:39:47,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:47,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:39:47,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:39:47,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:39:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:39:47,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:39:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:39:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:39:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:39:47,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure square [2025-03-08 00:39:47,745 INFO L138 BoogieDeclarations]: Found implementation of procedure square [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:39:47,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:39:47,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:39:47,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:39:47,799 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:39:47,800 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:39:47,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L49: call ULTIMATE.dealloc(main_~#array1~0#1.base, main_~#array1~0#1.offset);havoc main_~#array1~0#1.base, main_~#array1~0#1.offset;call ULTIMATE.dealloc(main_~#array2~0#1.base, main_~#array2~0#1.offset);havoc main_~#array2~0#1.base, main_~#array2~0#1.offset; [2025-03-08 00:39:47,953 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-08 00:39:47,955 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:39:47,961 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:39:47,962 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:39:47,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:39:47 BoogieIcfgContainer [2025-03-08 00:39:47,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:39:47,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:39:47,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:39:47,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:39:47,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:39:47" (1/3) ... [2025-03-08 00:39:47,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a281669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:39:47, skipping insertion in model container [2025-03-08 00:39:47,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:39:47" (2/3) ... [2025-03-08 00:39:47,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a281669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:39:47, skipping insertion in model container [2025-03-08 00:39:47,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:39:47" (3/3) ... [2025-03-08 00:39:47,971 INFO L128 eAbstractionObserver]: Analyzing ICFG array3_pattern.c [2025-03-08 00:39:47,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:39:47,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array3_pattern.c that has 3 procedures, 29 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:39:48,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:39:48,032 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;@110e5096, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:39:48,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:39:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:48,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:39:48,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:48,039 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:48,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:48,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1680816424, now seen corresponding path program 1 times [2025-03-08 00:39:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:48,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280935925] [2025-03-08 00:39:48,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:48,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:48,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:39:48,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:39:48,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:48,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:48,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280935925] [2025-03-08 00:39:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280935925] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:39:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298541312] [2025-03-08 00:39:48,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:48,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:39:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:48,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:39:48,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:39:48,169 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:39:48,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:48,178 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2025-03-08 00:39:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:39:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 00:39:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:48,183 INFO L225 Difference]: With dead ends: 55 [2025-03-08 00:39:48,183 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:39:48,185 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-08 00:39:48,187 INFO L435 NwaCegarLoop]: 33 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, 33 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-08 00:39:48,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:39:48,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 00:39:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-08 00:39:48,208 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2025-03-08 00:39:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:48,209 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-08 00:39:48,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:39:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-08 00:39:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:39:48,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:48,211 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:48,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:39:48,211 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:48,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:48,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1639796013, now seen corresponding path program 1 times [2025-03-08 00:39:48,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:48,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669612431] [2025-03-08 00:39:48,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:48,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:48,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:39:48,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:39:48,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:48,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:39:48,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:48,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669612431] [2025-03-08 00:39:48,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669612431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:48,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:48,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:39:48,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338744733] [2025-03-08 00:39:48,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:48,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:39:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:48,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:39:48,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:48,431 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:39:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:48,451 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2025-03-08 00:39:48,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:39:48,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-08 00:39:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:48,453 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:39:48,453 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:39:48,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:39:48,454 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:48,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 69 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:48,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:39:48,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-08 00:39:48,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:48,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-03-08 00:39:48,461 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 21 [2025-03-08 00:39:48,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:48,461 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-03-08 00:39:48,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:39:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-03-08 00:39:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-08 00:39:48,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:48,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:48,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:39:48,464 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:48,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:48,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1782903862, now seen corresponding path program 1 times [2025-03-08 00:39:48,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:48,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854260541] [2025-03-08 00:39:48,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:48,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:48,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-08 00:39:48,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-08 00:39:48,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:48,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:48,622 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:39:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:48,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854260541] [2025-03-08 00:39:48,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854260541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:39:48,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:39:48,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 00:39:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531026344] [2025-03-08 00:39:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:39:48,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 00:39:48,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:48,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 00:39:48,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:39:48,623 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:39:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:48,681 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2025-03-08 00:39:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 00:39:48,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2025-03-08 00:39:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:48,682 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:39:48,682 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:39:48,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:39:48,683 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:48,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 62 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:39:48,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:39:48,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-08 00:39:48,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:48,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-08 00:39:48,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2025-03-08 00:39:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:48,687 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-08 00:39:48,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:39:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-08 00:39:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 00:39:48,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:48,688 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:48,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:39:48,688 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:48,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:48,689 INFO L85 PathProgramCache]: Analyzing trace with hash 447476913, now seen corresponding path program 1 times [2025-03-08 00:39:48,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:48,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039174605] [2025-03-08 00:39:48,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:48,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:39:48,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:39:48,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:48,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:39:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [907883248] [2025-03-08 00:39:48,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:39:48,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:48,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:48,737 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:48,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:39:48,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 00:39:48,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 00:39:48,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:39:48,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:48,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-08 00:39:48,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:48,949 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-08 00:39:48,961 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-08 00:39:49,296 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:39:49,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:39:49,318 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-08 00:39:49,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2025-03-08 00:39:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:39:49,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:52,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:52,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039174605] [2025-03-08 00:39:52,273 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:39:52,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907883248] [2025-03-08 00:39:52,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907883248] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:52,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:39:52,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2025-03-08 00:39:52,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530966847] [2025-03-08 00:39:52,273 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:52,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:39:52,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:52,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:39:52,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:39:52,275 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:53,473 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2025-03-08 00:39:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 00:39:53,474 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 33 [2025-03-08 00:39:53,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:53,475 INFO L225 Difference]: With dead ends: 72 [2025-03-08 00:39:53,476 INFO L226 Difference]: Without dead ends: 69 [2025-03-08 00:39:53,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=363, Invalid=2087, Unknown=0, NotChecked=0, Total=2450 [2025-03-08 00:39:53,478 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 97 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:53,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 228 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:39:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-08 00:39:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 55. [2025-03-08 00:39:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-08 00:39:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2025-03-08 00:39:53,496 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 33 [2025-03-08 00:39:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:53,496 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2025-03-08 00:39:53,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 18 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:39:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2025-03-08 00:39:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 00:39:53,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:53,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:53,504 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:53,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:53,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:53,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:53,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1998914454, now seen corresponding path program 2 times [2025-03-08 00:39:53,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:53,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088644560] [2025-03-08 00:39:53,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:53,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:53,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:39:53,723 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:39:53,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:53,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:39:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088644560] [2025-03-08 00:39:53,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088644560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:53,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652263331] [2025-03-08 00:39:53,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:39:53,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:53,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:53,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:53,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:39:53,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-08 00:39:53,881 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 00:39:53,882 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:39:53,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:53,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:39:53,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:53,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:39:53,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:53,999 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 00:39:54,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652263331] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:54,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:54,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:39:54,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151115766] [2025-03-08 00:39:54,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:54,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:39:54,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:54,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:39:54,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:39:54,004 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:39:54,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:54,164 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2025-03-08 00:39:54,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:39:54,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 34 [2025-03-08 00:39:54,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:54,166 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:39:54,166 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 00:39:54,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 60 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-08 00:39:54,167 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:54,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 142 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 00:39:54,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2025-03-08 00:39:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-08 00:39:54,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2025-03-08 00:39:54,178 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 34 [2025-03-08 00:39:54,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:54,178 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2025-03-08 00:39:54,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-08 00:39:54,178 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2025-03-08 00:39:54,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-08 00:39:54,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:54,179 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:54,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 00:39:54,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:54,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:54,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash 155614104, now seen corresponding path program 3 times [2025-03-08 00:39:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028802748] [2025-03-08 00:39:54,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:39:54,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:54,390 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-08 00:39:54,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 44 statements. [2025-03-08 00:39:54,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:39:54,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:39:54,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:39:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028802748] [2025-03-08 00:39:54,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028802748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:39:54,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355589635] [2025-03-08 00:39:54,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:39:54,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:54,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:54,511 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:54,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:39:54,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 4 equivalence classes. [2025-03-08 00:39:54,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 39 of 44 statements. [2025-03-08 00:39:54,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:39:54,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:54,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:39:54,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:39:54,640 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:39:54,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:39:54,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355589635] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:39:54,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:39:54,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:39:54,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061446331] [2025-03-08 00:39:54,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:39:54,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:39:54,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:39:54,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:39:54,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:39:54,686 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 00:39:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:39:54,799 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2025-03-08 00:39:54,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:39:54,799 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 44 [2025-03-08 00:39:54,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:39:54,800 INFO L225 Difference]: With dead ends: 70 [2025-03-08 00:39:54,800 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:39:54,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:39:54,802 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:39:54,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 88 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:39:54,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:39:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2025-03-08 00:39:54,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:39:54,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2025-03-08 00:39:54,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 44 [2025-03-08 00:39:54,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:39:54,811 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2025-03-08 00:39:54,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 6 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-08 00:39:54,813 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2025-03-08 00:39:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 00:39:54,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:39:54,813 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:39:54,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:39:55,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:55,014 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:39:55,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:39:55,014 INFO L85 PathProgramCache]: Analyzing trace with hash -266232941, now seen corresponding path program 4 times [2025-03-08 00:39:55,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:39:55,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722971038] [2025-03-08 00:39:55,014 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:55,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:39:55,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:39:55,055 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:39:55,056 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:39:55,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:39:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108470863] [2025-03-08 00:39:55,057 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:39:55,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:39:55,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:39:55,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:39:55,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:39:55,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-03-08 00:39:55,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 00:39:55,171 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:39:55,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:39:55,173 WARN L254 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-08 00:39:55,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:39:55,227 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-08 00:39:55,234 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-08 00:39:55,274 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 19 treesize of output 18 [2025-03-08 00:39:55,281 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 19 treesize of output 18 [2025-03-08 00:39:55,632 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-08 00:39:55,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 123 [2025-03-08 00:39:55,714 INFO L349 Elim1Store]: treesize reduction 133, result has 23.1 percent of original size [2025-03-08 00:39:55,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 50 treesize of output 63 [2025-03-08 00:39:55,753 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-03-08 00:39:55,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2025-03-08 00:39:57,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:57,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 347 treesize of output 363 [2025-03-08 00:39:59,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:39:59,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 897 treesize of output 1235 [2025-03-08 00:40:01,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 317 treesize of output 281 [2025-03-08 00:40:02,193 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:40:02,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:09,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722971038] [2025-03-08 00:40:09,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:40:09,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108470863] [2025-03-08 00:40:09,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108470863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:09,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:40:09,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2025-03-08 00:40:09,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186838355] [2025-03-08 00:40:09,075 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:09,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:40:09,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:09,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:40:09,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 00:40:09,079 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:40:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:19,044 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2025-03-08 00:40:19,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-08 00:40:19,044 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 45 [2025-03-08 00:40:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:19,045 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:40:19,045 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 00:40:19,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=463, Invalid=3319, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 00:40:19,047 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:19,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 233 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 00:40:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 00:40:19,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2025-03-08 00:40:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-08 00:40:19,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2025-03-08 00:40:19,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 45 [2025-03-08 00:40:19,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:19,064 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2025-03-08 00:40:19,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 1.24) internal successors, (31), 21 states have internal predecessors, (31), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 00:40:19,065 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2025-03-08 00:40:19,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-08 00:40:19,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:19,065 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:19,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:40:19,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:19,270 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:19,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -458589448, now seen corresponding path program 5 times [2025-03-08 00:40:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:19,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277649298] [2025-03-08 00:40:19,271 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:40:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:19,277 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 4 equivalence classes. [2025-03-08 00:40:19,289 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:40:19,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:40:19,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:19,400 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:40:19,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277649298] [2025-03-08 00:40:19,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277649298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:19,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121670352] [2025-03-08 00:40:19,401 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:40:19,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:19,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:19,403 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:19,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:40:19,444 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 46 statements into 4 equivalence classes. [2025-03-08 00:40:19,471 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 00:40:19,472 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-08 00:40:19,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:19,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:40:19,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 00:40:19,544 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 00:40:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121670352] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:19,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:19,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:40:19,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796171036] [2025-03-08 00:40:19,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:19,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:40:19,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:19,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:40:19,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:40:19,591 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 00:40:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:19,820 INFO L93 Difference]: Finished difference Result 107 states and 127 transitions. [2025-03-08 00:40:19,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 00:40:19,820 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 46 [2025-03-08 00:40:19,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:19,821 INFO L225 Difference]: With dead ends: 107 [2025-03-08 00:40:19,821 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:40:19,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:40:19,822 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 17 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:19,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 246 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:40:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:40:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 95. [2025-03-08 00:40:19,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.106060606060606) internal successors, (73), 67 states have internal predecessors, (73), 20 states have call successors, (20), 8 states have call predecessors, (20), 8 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-08 00:40:19,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2025-03-08 00:40:19,862 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 46 [2025-03-08 00:40:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:19,862 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2025-03-08 00:40:19,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-08 00:40:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2025-03-08 00:40:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 00:40:19,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:19,864 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:19,872 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-08 00:40:20,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:20,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1276742558, now seen corresponding path program 1 times [2025-03-08 00:40:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685580986] [2025-03-08 00:40:20,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:20,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 00:40:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:40:20,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:20,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:20,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536367594] [2025-03-08 00:40:20,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:20,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:20,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:20,109 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:20,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:40:20,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 00:40:20,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 00:40:20,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:20,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:20,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-08 00:40:20,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:20,585 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-08 00:40:20,595 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-08 00:40:20,622 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 19 treesize of output 18 [2025-03-08 00:40:20,629 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 19 treesize of output 18 [2025-03-08 00:40:20,953 INFO L349 Elim1Store]: treesize reduction 133, result has 23.1 percent of original size [2025-03-08 00:40:20,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 50 treesize of output 63 [2025-03-08 00:40:20,990 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-08 00:40:20,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 123 [2025-03-08 00:40:21,037 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2025-03-08 00:40:21,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 157 [2025-03-08 00:40:21,059 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-03-08 00:40:22,334 INFO L349 Elim1Store]: treesize reduction 208, result has 29.5 percent of original size [2025-03-08 00:40:22,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 27 case distinctions, treesize of input 361 treesize of output 409 [2025-03-08 00:40:22,579 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-03-08 00:40:22,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 418 treesize of output 404