./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/sina1.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-fpi/sina1.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 b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:50:14,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:50:14,465 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:50:14,470 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:50:14,471 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:50:14,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:50:14,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:50:14,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:50:14,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:50:14,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:50:14,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:50:14,488 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:50:14,489 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:50:14,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:50:14,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:50:14,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:50:14,490 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 -> b1c30dcb0753c92b26d7933797d6cb35ad9e557c83930a4dbbba40b5521c6adf [2025-03-08 00:50:14,707 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:50:14,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:50:14,717 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:50:14,718 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:50:14,718 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:50:14,720 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/sina1.c [2025-03-08 00:50:15,859 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b7e87c/33aef6a63988416badbc4ebf9a3e9f90/FLAG1ad87c4c2 [2025-03-08 00:50:16,057 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:50:16,061 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1.c [2025-03-08 00:50:16,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b7e87c/33aef6a63988416badbc4ebf9a3e9f90/FLAG1ad87c4c2 [2025-03-08 00:50:16,427 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a2b7e87c/33aef6a63988416badbc4ebf9a3e9f90 [2025-03-08 00:50:16,429 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:50:16,431 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:50:16,433 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:16,433 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:50:16,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:50:16,437 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,439 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1047df11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16, skipping insertion in model container [2025-03-08 00:50:16,439 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,452 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:50:16,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1.c[588,601] [2025-03-08 00:50:16,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:16,571 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:50:16,579 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/sina1.c[588,601] [2025-03-08 00:50:16,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:50:16,591 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:50:16,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16 WrapperNode [2025-03-08 00:50:16,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:50:16,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:16,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:50:16,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:50:16,596 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:50:16" (1/1) ... [2025-03-08 00:50:16,600 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:50:16" (1/1) ... [2025-03-08 00:50:16,614 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 70 [2025-03-08 00:50:16,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:50:16,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:50:16,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:50:16,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:50:16,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,634 INFO L175 MemorySlicer]: Split 16 memory accesses to 4 slices as follows [2, 8, 2, 4]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 3 writes are split as follows [0, 0, 1, 2]. [2025-03-08 00:50:16,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,648 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:50:16,653 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:50:16,653 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:50:16,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:50:16,654 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (1/1) ... [2025-03-08 00:50:16,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:50:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:16,677 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:50:16,679 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:50:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:50:16,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:50:16,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:50:16,695 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:50:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:50:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 00:50:16,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:50:16,752 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:50:16,753 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:50:16,883 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-03-08 00:50:16,891 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-08 00:50:16,891 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:50:16,899 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:50:16,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:50:16,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:16 BoogieIcfgContainer [2025-03-08 00:50:16,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:50:16,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:50:16,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:50:16,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:50:16,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:50:16" (1/3) ... [2025-03-08 00:50:16,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22930ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:16, skipping insertion in model container [2025-03-08 00:50:16,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:50:16" (2/3) ... [2025-03-08 00:50:16,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22930ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:50:16, skipping insertion in model container [2025-03-08 00:50:16,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:50:16" (3/3) ... [2025-03-08 00:50:16,909 INFO L128 eAbstractionObserver]: Analyzing ICFG sina1.c [2025-03-08 00:50:16,922 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:50:16,923 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sina1.c that has 1 procedures, 15 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:50:16,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:50:16,978 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;@27200e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:50:16,978 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:50:16,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:16,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-08 00:50:16,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:16,984 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:16,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:16,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:16,988 INFO L85 PathProgramCache]: Analyzing trace with hash 835545623, now seen corresponding path program 1 times [2025-03-08 00:50:16,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:16,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167639108] [2025-03-08 00:50:16,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:16,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:17,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 00:50:17,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 00:50:17,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:17,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:17,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167639108] [2025-03-08 00:50:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167639108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:50:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:50:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:50:17,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320319863] [2025-03-08 00:50:17,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:50:17,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:50:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:17,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:50:17,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:17,217 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:17,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:17,266 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2025-03-08 00:50:17,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:50:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-08 00:50:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:17,274 INFO L225 Difference]: With dead ends: 36 [2025-03-08 00:50:17,274 INFO L226 Difference]: Without dead ends: 19 [2025-03-08 00:50:17,276 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:50:17,278 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:17,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:17,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-08 00:50:17,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2025-03-08 00:50:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:17,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2025-03-08 00:50:17,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10 [2025-03-08 00:50:17,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:17,300 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2025-03-08 00:50:17,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:17,300 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2025-03-08 00:50:17,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:50:17,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:17,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:17,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:50:17,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:17,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:17,301 INFO L85 PathProgramCache]: Analyzing trace with hash 747160855, now seen corresponding path program 1 times [2025-03-08 00:50:17,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:17,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036968607] [2025-03-08 00:50:17,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:17,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:17,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:50:17,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:50:17,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:17,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036968607] [2025-03-08 00:50:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036968607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099498412] [2025-03-08 00:50:17,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:17,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:17,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:17,885 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:50:17,885 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:50:17,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:50:17,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:50:17,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:17,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:17,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 00:50:17,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:17,996 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:50:18,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:18,123 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:50:18,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:18,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:18,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2025-03-08 00:50:18,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2025-03-08 00:50:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099498412] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:18,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-08 00:50:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393633347] [2025-03-08 00:50:18,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:50:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:18,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:50:18,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:50:18,274 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,464 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-03-08 00:50:18,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 00:50:18,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:50:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,465 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:50:18,465 INFO L226 Difference]: Without dead ends: 27 [2025-03-08 00:50:18,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:18,466 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 57 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-08 00:50:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 19. [2025-03-08 00:50:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-08 00:50:18,472 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2025-03-08 00:50:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:18,473 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-08 00:50:18,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-08 00:50:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-08 00:50:18,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:18,475 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:18,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:50:18,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:18,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:18,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1690729168, now seen corresponding path program 2 times [2025-03-08 00:50:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188891509] [2025-03-08 00:50:18,676 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:18,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:50:18,691 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:18,691 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:18,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:18,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188891509] [2025-03-08 00:50:18,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188891509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:18,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048753001] [2025-03-08 00:50:18,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:18,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:18,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:18,742 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:50:18,743 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:50:18,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-08 00:50:18,795 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-08 00:50:18,795 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:18,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:18,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:18,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:18,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:18,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048753001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:18,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:18,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:50:18,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765350118] [2025-03-08 00:50:18,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:18,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:18,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:18,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:18,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:18,875 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:18,994 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-03-08 00:50:18,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:50:18,994 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-08 00:50:18,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:18,995 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:50:18,995 INFO L226 Difference]: Without dead ends: 35 [2025-03-08 00:50:18,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:50:18,996 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:18,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 53 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:18,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-08 00:50:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2025-03-08 00:50:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 00:50:19,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 13 [2025-03-08 00:50:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:19,004 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 00:50:19,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:19,004 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 00:50:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:50:19,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:19,005 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:19,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:19,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:50:19,209 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:19,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:19,209 INFO L85 PathProgramCache]: Analyzing trace with hash -872041385, now seen corresponding path program 3 times [2025-03-08 00:50:19,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:19,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704180877] [2025-03-08 00:50:19,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:19,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:50:19,237 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:50:19,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:50:19,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:19,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704180877] [2025-03-08 00:50:19,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704180877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:19,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253987750] [2025-03-08 00:50:19,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:19,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:19,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:19,569 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:50:19,571 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:50:19,609 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 14 statements into 2 equivalence classes. [2025-03-08 00:50:19,623 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:50:19,623 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:50:19,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:19,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-08 00:50:19,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:19,636 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:50:19,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:19,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:19,728 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:50:19,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:19,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:50:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:19,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:19,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-03-08 00:50:19,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-08 00:50:19,952 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:19,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253987750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:19,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:19,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 23 [2025-03-08 00:50:19,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588782610] [2025-03-08 00:50:19,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:19,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:19,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:19,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:19,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:19,954 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:20,347 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2025-03-08 00:50:20,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 00:50:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:50:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:20,348 INFO L225 Difference]: With dead ends: 66 [2025-03-08 00:50:20,348 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:50:20,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=1274, Unknown=0, NotChecked=0, Total=1560 [2025-03-08 00:50:20,349 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:20,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 90 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:20,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:50:20,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 25. [2025-03-08 00:50:20,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-03-08 00:50:20,359 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 14 [2025-03-08 00:50:20,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:20,359 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-03-08 00:50:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,360 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-03-08 00:50:20,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 00:50:20,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:20,361 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:20,367 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:50:20,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:20,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:20,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:20,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2145591052, now seen corresponding path program 1 times [2025-03-08 00:50:20,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:20,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069673859] [2025-03-08 00:50:20,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:20,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:50:20,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:50:20,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:20,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:20,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069673859] [2025-03-08 00:50:20,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069673859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:20,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144739634] [2025-03-08 00:50:20,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:50:20,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:20,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:20,650 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:50:20,652 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:50:20,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 00:50:20,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 00:50:20,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:20,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:20,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:50:20,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:20,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:20,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:20,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144739634] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:20,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:20,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:50:20,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538016660] [2025-03-08 00:50:20,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:20,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:20,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:20,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:20,770 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:20,845 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2025-03-08 00:50:20,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:50:20,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 00:50:20,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:20,846 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:50:20,846 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 00:50:20,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 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:50:20,846 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:20,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 46 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:20,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 00:50:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 23. [2025-03-08 00:50:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-08 00:50:20,854 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2025-03-08 00:50:20,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:20,854 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-08 00:50:20,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-08 00:50:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:50:20,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:20,854 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:20,864 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:50:21,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:21,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:21,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash -547223721, now seen corresponding path program 4 times [2025-03-08 00:50:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:21,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541471259] [2025-03-08 00:50:21,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:21,065 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:50:21,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:50:21,074 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:21,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541471259] [2025-03-08 00:50:21,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541471259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189372112] [2025-03-08 00:50:21,433 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:21,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:21,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:21,435 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:50:21,437 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:50:21,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-08 00:50:21,485 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:50:21,485 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:50:21,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:21,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:50:21,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:21,494 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:50:21,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:21,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:21,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:21,598 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:50:21,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:21,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:50:21,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:21,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:50:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:21,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:21,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2025-03-08 00:50:21,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 98 [2025-03-08 00:50:22,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:22,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189372112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:22,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:22,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29 [2025-03-08 00:50:22,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873513397] [2025-03-08 00:50:22,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:22,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:50:22,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:22,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:50:22,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:50:22,067 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:22,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:22,733 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2025-03-08 00:50:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-08 00:50:22,734 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:50:22,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:22,734 INFO L225 Difference]: With dead ends: 63 [2025-03-08 00:50:22,734 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 00:50:22,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=425, Invalid=2331, Unknown=0, NotChecked=0, Total=2756 [2025-03-08 00:50:22,736 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 144 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:22,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 131 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:50:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 00:50:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 26. [2025-03-08 00:50:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2025-03-08 00:50:22,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2025-03-08 00:50:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:22,740 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2025-03-08 00:50:22,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:22,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2025-03-08 00:50:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:50:22,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:22,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:22,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:50:22,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:22,941 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:22,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:22,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1273145780, now seen corresponding path program 2 times [2025-03-08 00:50:22,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:22,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322153888] [2025-03-08 00:50:22,942 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:22,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:22,948 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:50:22,974 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:22,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:22,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:23,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:23,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322153888] [2025-03-08 00:50:23,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322153888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:23,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101281584] [2025-03-08 00:50:23,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:50:23,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:23,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:23,310 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:50:23,312 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:50:23,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-08 00:50:23,358 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:50:23,358 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:50:23,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:23,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 00:50:23,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:23,366 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:50:23,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:23,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:23,434 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:50:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:23,485 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:23,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-03-08 00:50:23,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-03-08 00:50:23,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:50:23,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101281584] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:23,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:23,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 23 [2025-03-08 00:50:23,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108539277] [2025-03-08 00:50:23,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:23,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 00:50:23,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:23,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 00:50:23,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:50:23,601 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:23,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:23,866 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-08 00:50:23,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 00:50:23,867 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:50:23,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:23,867 INFO L225 Difference]: With dead ends: 52 [2025-03-08 00:50:23,867 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 00:50:23,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:50:23,868 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 35 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:23,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 104 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 00:50:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2025-03-08 00:50:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2025-03-08 00:50:23,875 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2025-03-08 00:50:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:23,876 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2025-03-08 00:50:23,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:23,876 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2025-03-08 00:50:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:50:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:23,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:23,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:24,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:24,077 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:24,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1354856116, now seen corresponding path program 3 times [2025-03-08 00:50:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:24,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040121244] [2025-03-08 00:50:24,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:24,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 00:50:24,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:50:24,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:24,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:24,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040121244] [2025-03-08 00:50:24,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040121244] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:24,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127593892] [2025-03-08 00:50:24,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:50:24,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:24,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:24,423 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:24,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:50:24,464 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 3 equivalence classes. [2025-03-08 00:50:24,482 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:50:24,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:50:24,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:24,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:50:24,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:24,489 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:50:24,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:24,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:24,590 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:50:24,620 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:50:24,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:24,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:24,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:24,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-08 00:50:24,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:24,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:24,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-03-08 00:50:24,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 454 [2025-03-08 00:50:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:25,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127593892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:25,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:25,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-03-08 00:50:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029436590] [2025-03-08 00:50:25,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:25,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:50:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:25,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:50:25,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:50:25,062 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:26,180 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2025-03-08 00:50:26,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-08 00:50:26,180 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 00:50:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:26,184 INFO L225 Difference]: With dead ends: 111 [2025-03-08 00:50:26,184 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:50:26,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=854, Invalid=4258, Unknown=0, NotChecked=0, Total=5112 [2025-03-08 00:50:26,185 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 164 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:26,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 88 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:50:26,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:50:26,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 43. [2025-03-08 00:50:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2025-03-08 00:50:26,199 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 19 [2025-03-08 00:50:26,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:26,199 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2025-03-08 00:50:26,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,199 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2025-03-08 00:50:26,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:50:26,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:26,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:26,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:26,400 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:26,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1789882960, now seen corresponding path program 4 times [2025-03-08 00:50:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:26,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412054795] [2025-03-08 00:50:26,401 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:26,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:26,406 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-08 00:50:26,410 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-03-08 00:50:26,410 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:26,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412054795] [2025-03-08 00:50:26,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412054795] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:26,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318430848] [2025-03-08 00:50:26,452 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:50:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:26,455 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:26,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:50:26,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-03-08 00:50:26,512 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 21 statements. [2025-03-08 00:50:26,512 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:50:26,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:26,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:50:26,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:26,556 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:26,585 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:26,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318430848] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:26,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:26,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2025-03-08 00:50:26,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410445228] [2025-03-08 00:50:26,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:26,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:50:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:26,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:50:26,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:50:26,586 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:26,647 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2025-03-08 00:50:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:50:26,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:50:26,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:26,647 INFO L225 Difference]: With dead ends: 77 [2025-03-08 00:50:26,647 INFO L226 Difference]: Without dead ends: 57 [2025-03-08 00:50:26,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:50:26,649 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:26,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 42 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:50:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-08 00:50:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2025-03-08 00:50:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2025-03-08 00:50:26,662 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 21 [2025-03-08 00:50:26,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:26,663 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2025-03-08 00:50:26,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:26,663 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2025-03-08 00:50:26,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:50:26,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:26,664 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:26,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:50:26,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:50:26,868 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:26,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1583223241, now seen corresponding path program 5 times [2025-03-08 00:50:26,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:26,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869867880] [2025-03-08 00:50:26,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:26,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:26,874 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-08 00:50:26,886 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:50:26,886 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:50:26,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869867880] [2025-03-08 00:50:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869867880] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:27,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122056297] [2025-03-08 00:50:27,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:50:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:27,135 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:27,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:50:27,176 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-03-08 00:50:27,195 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:50:27,196 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:50:27,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:27,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-08 00:50:27,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:27,203 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:50:27,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:27,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:27,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:27,315 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:50:27,340 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:50:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:27,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:27,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2025-03-08 00:50:27,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:27,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 159 [2025-03-08 00:50:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:50:27,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122056297] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:27,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:27,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 12] total 35 [2025-03-08 00:50:27,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431341649] [2025-03-08 00:50:27,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:27,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 00:50:27,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:27,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 00:50:27,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1075, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:50:27,728 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:28,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:28,608 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-03-08 00:50:28,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 00:50:28,608 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:50:28,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:28,608 INFO L225 Difference]: With dead ends: 89 [2025-03-08 00:50:28,609 INFO L226 Difference]: Without dead ends: 75 [2025-03-08 00:50:28,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=559, Invalid=3997, Unknown=0, NotChecked=0, Total=4556 [2025-03-08 00:50:28,610 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 143 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:28,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 188 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:50:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-08 00:50:28,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 29. [2025-03-08 00:50:28,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-03-08 00:50:28,619 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2025-03-08 00:50:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:28,619 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-03-08 00:50:28,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-03-08 00:50:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:50:28,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:28,621 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:28,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:28,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:50:28,821 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:28,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:28,822 INFO L85 PathProgramCache]: Analyzing trace with hash 64878491, now seen corresponding path program 6 times [2025-03-08 00:50:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:28,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810840718] [2025-03-08 00:50:28,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:28,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:28,828 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-03-08 00:50:28,838 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:50:28,840 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:50:28,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:50:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810840718] [2025-03-08 00:50:28,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810840718] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450450164] [2025-03-08 00:50:28,927 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:50:28,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:28,929 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:28,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:50:28,974 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 4 equivalence classes. [2025-03-08 00:50:28,992 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:50:28,993 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:50:28,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:28,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:50:28,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:29,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:50:29,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:29,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 00:50:29,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450450164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:50:29,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:50:29,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 19 [2025-03-08 00:50:29,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22724515] [2025-03-08 00:50:29,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:50:29,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:50:29,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:50:29,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:50:29,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2025-03-08 00:50:29,112 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:29,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:50:29,262 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-03-08 00:50:29,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 00:50:29,263 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:50:29,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:50:29,263 INFO L225 Difference]: With dead ends: 83 [2025-03-08 00:50:29,263 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 00:50:29,264 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:50:29,264 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 100 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:50:29,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 80 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:50:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 00:50:29,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 40. [2025-03-08 00:50:29,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2025-03-08 00:50:29,274 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2025-03-08 00:50:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:50:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2025-03-08 00:50:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:50:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2025-03-08 00:50:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:50:29,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:50:29,275 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:50:29,281 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:50:29,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:50:29,476 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:50:29,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:50:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -420205452, now seen corresponding path program 7 times [2025-03-08 00:50:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:50:29,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686032459] [2025-03-08 00:50:29,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:29,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:50:29,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:50:29,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:50:29,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:29,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:30,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:50:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686032459] [2025-03-08 00:50:30,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686032459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:50:30,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030333786] [2025-03-08 00:50:30,034 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:50:30,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:50:30,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:50:30,053 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:50:30,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:50:30,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:50:30,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:50:30,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:50:30,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:50:30,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-08 00:50:30,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:50:30,147 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:50:30,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:30,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:30,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:30,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:50:30,277 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:50:30,306 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:50:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:30,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-08 00:50:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:30,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-08 00:50:30,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:50:30,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:50:30,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2025-03-08 00:50:30,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:50:30,520 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:50:31,920 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_422 Int) (|v_ULTIMATE.start_main_~i~0#1_157| Int) (|v_ULTIMATE.start_main_~i~0#1_156| Int) (v_ArrVal_425 Int) (v_ArrVal_424 Int)) (or (= c_~N~0 (select (store (store (store (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_422) (+ (* |v_ULTIMATE.start_main_~i~0#1_157| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_424) (+ (* |v_ULTIMATE.start_main_~i~0#1_156| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_425) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (< |v_ULTIMATE.start_main_~i~0#1_156| (+ |v_ULTIMATE.start_main_~i~0#1_157| 1)) (< |v_ULTIMATE.start_main_~i~0#1_157| (+ |c_ULTIMATE.start_main_~i~0#1| 1)))) is different from false [2025-03-08 00:51:16,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2025-03-08 00:51:16,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6902 treesize of output 6838 [2025-03-08 00:51:16,671 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 5 not checked. [2025-03-08 00:51:16,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030333786] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:16,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:16,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 13] total 40 [2025-03-08 00:51:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828824849] [2025-03-08 00:51:16,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:16,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 00:51:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:16,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 00:51:16,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1299, Unknown=9, NotChecked=74, Total=1560 [2025-03-08 00:51:16,673 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 40 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:18,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:22,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:27,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:29,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:33,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:38,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:42,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-08 00:51:46,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:51:46,917 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2025-03-08 00:51:46,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 00:51:46,918 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-03-08 00:51:46,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:51:46,918 INFO L225 Difference]: With dead ends: 91 [2025-03-08 00:51:46,919 INFO L226 Difference]: Without dead ends: 83 [2025-03-08 00:51:46,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=458, Invalid=3197, Unknown=9, NotChecked=118, Total=3782 [2025-03-08 00:51:46,920 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 101 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 35 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:51:46,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 210 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 616 Invalid, 15 Unknown, 86 Unchecked, 29.4s Time] [2025-03-08 00:51:46,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-08 00:51:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2025-03-08 00:51:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1428571428571428) internal successors, (56), 49 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-08 00:51:46,934 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 23 [2025-03-08 00:51:46,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:51:46,934 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-08 00:51:46,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.35) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:51:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-08 00:51:46,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:51:46,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:51:46,935 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:51:46,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-08 00:51:47,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:51:47,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:51:47,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:51:47,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1489920119, now seen corresponding path program 8 times [2025-03-08 00:51:47,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:51:47,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501303580] [2025-03-08 00:51:47,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:51:47,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:51:47,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:51:47,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:47,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:47,794 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:47,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:51:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501303580] [2025-03-08 00:51:47,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501303580] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:51:47,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438842637] [2025-03-08 00:51:47,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:51:47,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:51:47,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:51:47,797 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:51:47,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:51:47,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:51:47,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:51:47,869 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:51:47,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:51:47,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-03-08 00:51:47,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:51:47,882 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:51:47,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:51:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:51:47,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:51:47,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:51:47,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-03-08 00:51:48,077 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:51:48,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:51:48,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:51:48,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:51:48,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-08 00:51:48,225 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:51:48,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:51:48,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2025-03-08 00:51:48,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2025-03-08 00:51:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 00:51:48,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438842637] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:51:48,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:51:48,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 14] total 41 [2025-03-08 00:51:48,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100102039] [2025-03-08 00:51:48,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:51:48,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 00:51:48,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:51:48,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 00:51:48,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:51:48,545 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 41 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)