./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-crafted/mapsum3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-crafted/mapsum3.i -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 9b90ab1091eaaf5a02261d2d1915a4d1b86c95775292408734bcf8be79905641 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:21:32,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:21:32,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:21:32,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:21:32,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:21:32,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:21:32,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:21:32,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:21:32,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:21:32,844 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:21:32,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:21:32,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:21:32,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:21:32,846 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:21:32,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:21:32,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:21:32,847 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:21:32,848 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:21:32,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:21:32,849 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:21:32,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:21:32,849 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 -> 9b90ab1091eaaf5a02261d2d1915a4d1b86c95775292408734bcf8be79905641 [2025-03-03 09:21:33,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:21:33,086 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:21:33,089 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:21:33,090 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:21:33,090 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:21:33,091 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-crafted/mapsum3.i [2025-03-03 09:21:34,211 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6643a98bd/42699cf1a01f4c48b23240ff98bdd9d2/FLAG0a6fb9f2f [2025-03-03 09:21:34,424 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:21:34,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-crafted/mapsum3.i [2025-03-03 09:21:34,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6643a98bd/42699cf1a01f4c48b23240ff98bdd9d2/FLAG0a6fb9f2f [2025-03-03 09:21:34,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6643a98bd/42699cf1a01f4c48b23240ff98bdd9d2 [2025-03-03 09:21:34,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:21:34,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:21:34,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:21:34,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:21:34,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:21:34,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6afb79a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34, skipping insertion in model container [2025-03-03 09:21:34,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:21:34,598 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-crafted/mapsum3.i[1312,1325] [2025-03-03 09:21:34,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:21:34,607 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:21:34,622 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-crafted/mapsum3.i[1312,1325] [2025-03-03 09:21:34,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:21:34,633 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:21:34,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34 WrapperNode [2025-03-03 09:21:34,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:21:34,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:21:34,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:21:34,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:21:34,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,659 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-03 09:21:34,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:21:34,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:21:34,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:21:34,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:21:34,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,674 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-03-03 09:21:34,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,677 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,678 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,680 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:21:34,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:21:34,680 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:21:34,680 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:21:34,681 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (1/1) ... [2025-03-03 09:21:34,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:21:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:34,702 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 09:21:34,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 09:21:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:21:34,719 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2025-03-03 09:21:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:21:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:21:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:21:34,765 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:21:34,767 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:21:34,877 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#x~0#1.base, main_~#x~0#1.offset);havoc main_~#x~0#1.base, main_~#x~0#1.offset; [2025-03-03 09:21:34,884 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-03 09:21:34,884 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:21:34,889 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:21:34,890 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:21:34,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:21:34 BoogieIcfgContainer [2025-03-03 09:21:34,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:21:34,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:21:34,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:21:34,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:21:34,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:21:34" (1/3) ... [2025-03-03 09:21:34,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c158225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:21:34, skipping insertion in model container [2025-03-03 09:21:34,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:21:34" (2/3) ... [2025-03-03 09:21:34,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c158225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:21:34, skipping insertion in model container [2025-03-03 09:21:34,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:21:34" (3/3) ... [2025-03-03 09:21:34,896 INFO L128 eAbstractionObserver]: Analyzing ICFG mapsum3.i [2025-03-03 09:21:34,904 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:21:34,905 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mapsum3.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-03 09:21:34,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:21:34,939 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;@469999d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:21:34,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:21:34,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 09:21:34,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:34,945 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:34,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:34,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1926114205, now seen corresponding path program 1 times [2025-03-03 09:21:34,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:34,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810161916] [2025-03-03 09:21:34,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:34,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:34,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 09:21:35,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 09:21:35,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:35,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:35,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:21:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:35,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810161916] [2025-03-03 09:21:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810161916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:21:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:21:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:21:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991623544] [2025-03-03 09:21:35,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:35,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:21:35,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:35,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:21:35,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:21:35,177 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:35,201 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-03-03 09:21:35,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:21:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-03 09:21:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:35,207 INFO L225 Difference]: With dead ends: 40 [2025-03-03 09:21:35,207 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 09:21:35,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:21:35,213 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:35,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:35,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 09:21:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 09:21:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-03 09:21:35,239 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2025-03-03 09:21:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:35,239 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-03 09:21:35,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-03 09:21:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-03 09:21:35,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:35,241 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:35,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:21:35,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1969556302, now seen corresponding path program 1 times [2025-03-03 09:21:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864604511] [2025-03-03 09:21:35,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:35,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:21:35,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:21:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:21:35,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:35,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864604511] [2025-03-03 09:21:35,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864604511] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:35,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345463539] [2025-03-03 09:21:35,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:35,366 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:35,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 09:21:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-03 09:21:35,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-03 09:21:35,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:35,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:35,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:21:35,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:21:35,458 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:21:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345463539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:21:35,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:21:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:21:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139109719] [2025-03-03 09:21:35,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:35,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:21:35,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:21:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:21:35,461 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:35,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:35,466 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-03-03 09:21:35,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:21:35,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-03 09:21:35,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:35,467 INFO L225 Difference]: With dead ends: 32 [2025-03-03 09:21:35,467 INFO L226 Difference]: Without dead ends: 19 [2025-03-03 09:21:35,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:21:35,468 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:35,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:35,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-03 09:21:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-03 09:21:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-03 09:21:35,471 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-03 09:21:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:35,471 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-03 09:21:35,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-03 09:21:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 09:21:35,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:35,472 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:35,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:35,676 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-03 09:21:35,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:35,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:35,678 INFO L85 PathProgramCache]: Analyzing trace with hash -375679269, now seen corresponding path program 1 times [2025-03-03 09:21:35,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:35,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492250325] [2025-03-03 09:21:35,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:35,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:35,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:21:35,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:21:35,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:35,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:35,804 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 09:21:35,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492250325] [2025-03-03 09:21:35,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492250325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:35,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149718972] [2025-03-03 09:21:35,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:35,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:35,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:35,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:35,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:21:35,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-03 09:21:35,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 09:21:35,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:35,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:35,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:21:35,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 09:21:35,885 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:21:35,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149718972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:21:35,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:21:35,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 09:21:35,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458312620] [2025-03-03 09:21:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:21:35,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:21:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:35,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:21:35,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:21:35,887 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:35,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:35,897 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-03 09:21:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:21:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-03 09:21:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:35,898 INFO L225 Difference]: With dead ends: 30 [2025-03-03 09:21:35,899 INFO L226 Difference]: Without dead ends: 20 [2025-03-03 09:21:35,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 09:21:35,900 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:35,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-03 09:21:35,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-03 09:21:35,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-03 09:21:35,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 28 [2025-03-03 09:21:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:35,907 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-03 09:21:35,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:21:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-03 09:21:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:21:35,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:35,908 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:35,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:36,114 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-03 09:21:36,115 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:36,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:36,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1210399376, now seen corresponding path program 1 times [2025-03-03 09:21:36,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:36,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549351415] [2025-03-03 09:21:36,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:36,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:36,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:21:36,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:21:36,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:36,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:36,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549351415] [2025-03-03 09:21:36,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549351415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:36,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11263744] [2025-03-03 09:21:36,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:21:36,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:36,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:36,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:36,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:21:36,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:21:36,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:21:36,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:36,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:36,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:21:36,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:36,276 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:36,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:36,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:36,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11263744] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:36,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:36,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 09:21:36,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908495087] [2025-03-03 09:21:36,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:36,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 09:21:36,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:36,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 09:21:36,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:21:36,305 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:36,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:36,321 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-03-03 09:21:36,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:21:36,321 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2025-03-03 09:21:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:36,322 INFO L225 Difference]: With dead ends: 39 [2025-03-03 09:21:36,322 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 09:21:36,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 09:21:36,323 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:36,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 09:21:36,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-03-03 09:21:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-03-03 09:21:36,328 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2025-03-03 09:21:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:36,328 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-03-03 09:21:36,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-03-03 09:21:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-03 09:21:36,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:36,329 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:36,335 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-03 09:21:36,529 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-03 09:21:36,529 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:36,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:36,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1738505925, now seen corresponding path program 2 times [2025-03-03 09:21:36,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:36,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277313608] [2025-03-03 09:21:36,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:36,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:36,541 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:21:36,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:21:36,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:36,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:21:36,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277313608] [2025-03-03 09:21:36,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277313608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:36,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444427937] [2025-03-03 09:21:36,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:36,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:36,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:36,636 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:36,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:21:36,680 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-03 09:21:36,699 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-03-03 09:21:36,700 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:36,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:36,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:21:36,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:36,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:36,836 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:21:36,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444427937] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:36,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:36,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-03-03 09:21:36,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84491985] [2025-03-03 09:21:36,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:36,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:21:36,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:36,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:21:36,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:21:36,839 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:21:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:36,864 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-03-03 09:21:36,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 09:21:36,866 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2025-03-03 09:21:36,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:36,867 INFO L225 Difference]: With dead ends: 46 [2025-03-03 09:21:36,867 INFO L226 Difference]: Without dead ends: 30 [2025-03-03 09:21:36,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:21:36,868 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:36,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-03 09:21:36,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-03 09:21:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-03-03 09:21:36,874 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 32 [2025-03-03 09:21:36,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:36,874 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-03-03 09:21:36,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-03 09:21:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-03-03 09:21:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-03 09:21:36,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:36,875 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:36,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:21:37,075 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-03 09:21:37,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2102730442, now seen corresponding path program 3 times [2025-03-03 09:21:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733789468] [2025-03-03 09:21:37,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:37,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-03 09:21:37,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-03-03 09:21:37,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:21:37,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:37,147 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 09:21:37,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733789468] [2025-03-03 09:21:37,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733789468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:37,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740181529] [2025-03-03 09:21:37,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:37,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:37,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:37,149 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:37,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:21:37,204 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-03-03 09:21:37,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-03-03 09:21:37,218 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 09:21:37,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:37,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:21:37,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:37,238 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 09:21:37,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-03 09:21:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740181529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:37,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:37,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 09:21:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406707192] [2025-03-03 09:21:37,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:37,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:21:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:37,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:21:37,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:21:37,272 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:37,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:37,284 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-03-03 09:21:37,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:21:37,284 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-03-03 09:21:37,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:37,285 INFO L225 Difference]: With dead ends: 50 [2025-03-03 09:21:37,285 INFO L226 Difference]: Without dead ends: 34 [2025-03-03 09:21:37,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:21:37,285 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:37,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:37,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-03 09:21:37,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-03 09:21:37,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-03-03 09:21:37,290 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2025-03-03 09:21:37,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:37,290 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-03-03 09:21:37,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-03-03 09:21:37,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 09:21:37,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:37,293 INFO L218 NwaCegarLoop]: trace histogram [18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:37,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:37,494 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-03 09:21:37,494 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:37,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:37,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1775178890, now seen corresponding path program 4 times [2025-03-03 09:21:37,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:37,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163451437] [2025-03-03 09:21:37,495 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:21:37,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:37,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 09:21:37,533 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:21:37,534 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:21:37,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 09:21:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:37,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163451437] [2025-03-03 09:21:37,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163451437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:37,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426903054] [2025-03-03 09:21:37,756 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:21:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:37,758 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:37,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:21:37,812 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-03-03 09:21:37,846 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 09:21:37,846 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:21:37,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:37,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 09:21:37,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:37,882 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 09:21:37,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:38,075 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-03 09:21:38,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426903054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:38,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:38,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-03 09:21:38,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291222779] [2025-03-03 09:21:38,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:38,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 09:21:38,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:38,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 09:21:38,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:21:38,077 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:38,109 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2025-03-03 09:21:38,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 09:21:38,110 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2025-03-03 09:21:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:38,110 INFO L225 Difference]: With dead ends: 67 [2025-03-03 09:21:38,110 INFO L226 Difference]: Without dead ends: 46 [2025-03-03 09:21:38,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-03 09:21:38,111 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:38,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-03 09:21:38,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-03-03 09:21:38,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:38,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2025-03-03 09:21:38,116 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 53 [2025-03-03 09:21:38,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:38,116 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2025-03-03 09:21:38,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.68) internal successors, (42), 25 states have internal predecessors, (42), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2025-03-03 09:21:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-03 09:21:38,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:38,117 INFO L218 NwaCegarLoop]: trace histogram [22, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:38,123 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-03 09:21:38,321 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-03 09:21:38,321 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash -585321270, now seen corresponding path program 5 times [2025-03-03 09:21:38,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014650407] [2025-03-03 09:21:38,322 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:21:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:38,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 12 equivalence classes. [2025-03-03 09:21:38,426 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 54 of 65 statements. [2025-03-03 09:21:38,426 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:21:38,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-03-03 09:21:38,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014650407] [2025-03-03 09:21:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014650407] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188039078] [2025-03-03 09:21:38,482 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:21:38,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:38,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:38,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:38,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:21:38,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 65 statements into 12 equivalence classes. [2025-03-03 09:21:38,798 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 54 of 65 statements. [2025-03-03 09:21:38,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:21:38,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:38,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:21:38,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:38,810 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 104 proven. 1 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-03 09:21:38,810 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-03-03 09:21:38,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188039078] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:38,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:38,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-03 09:21:38,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126971568] [2025-03-03 09:21:38,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:38,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:21:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:38,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:21:38,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:21:38,833 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:21:38,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:38,845 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2025-03-03 09:21:38,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:21:38,846 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2025-03-03 09:21:38,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:38,846 INFO L225 Difference]: With dead ends: 64 [2025-03-03 09:21:38,846 INFO L226 Difference]: Without dead ends: 49 [2025-03-03 09:21:38,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:21:38,847 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:38,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:38,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-03 09:21:38,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-03 09:21:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2025-03-03 09:21:38,852 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 65 [2025-03-03 09:21:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:38,852 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2025-03-03 09:21:38,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:21:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2025-03-03 09:21:38,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-03 09:21:38,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:38,853 INFO L218 NwaCegarLoop]: trace histogram [22, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:38,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:21:39,057 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-03 09:21:39,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:39,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:39,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1385026717, now seen corresponding path program 6 times [2025-03-03 09:21:39,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:39,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-03-03 09:21:39,058 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:21:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:39,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 12 equivalence classes. [2025-03-03 09:21:39,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 68 statements. [2025-03-03 09:21:39,138 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:21:39,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-03-03 09:21:39,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555181813] [2025-03-03 09:21:39,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555181813] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:39,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069419491] [2025-03-03 09:21:39,239 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:21:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:39,241 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:39,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:21:39,316 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 68 statements into 12 equivalence classes. [2025-03-03 09:21:39,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 68 statements. [2025-03-03 09:21:39,398 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:21:39,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:39,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:21:39,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 104 proven. 10 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2025-03-03 09:21:39,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2025-03-03 09:21:39,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069419491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:39,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:39,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-03 09:21:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966846426] [2025-03-03 09:21:39,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:39,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:21:39,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:39,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:21:39,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:21:39,464 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:21:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:39,480 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-03-03 09:21:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 09:21:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 68 [2025-03-03 09:21:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:39,481 INFO L225 Difference]: With dead ends: 70 [2025-03-03 09:21:39,481 INFO L226 Difference]: Without dead ends: 55 [2025-03-03 09:21:39,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:21:39,481 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:39,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-03 09:21:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-03-03 09:21:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-03-03 09:21:39,488 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 68 [2025-03-03 09:21:39,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:39,489 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-03-03 09:21:39,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 09:21:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-03-03 09:21:39,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-03 09:21:39,490 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:39,490 INFO L218 NwaCegarLoop]: trace histogram [22, 18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:39,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:39,694 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-03 09:21:39,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:39,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:39,694 INFO L85 PathProgramCache]: Analyzing trace with hash -2120944259, now seen corresponding path program 7 times [2025-03-03 09:21:39,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:39,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401799720] [2025-03-03 09:21:39,695 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:21:39,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:39,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 09:21:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 09:21:39,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:39,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:40,206 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:40,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401799720] [2025-03-03 09:21:40,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401799720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:40,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709004870] [2025-03-03 09:21:40,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:21:40,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:40,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:40,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:40,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:21:40,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-03 09:21:40,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-03 09:21:40,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:21:40,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:40,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 09:21:40,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:40,379 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:40,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:40,995 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:40,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709004870] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:40,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:40,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2025-03-03 09:21:40,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026057448] [2025-03-03 09:21:40,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:40,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-03 09:21:40,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:40,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-03 09:21:40,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:21:40,998 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:41,047 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2025-03-03 09:21:41,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-03 09:21:41,048 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 74 [2025-03-03 09:21:41,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:41,049 INFO L225 Difference]: With dead ends: 109 [2025-03-03 09:21:41,049 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 09:21:41,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 09:21:41,052 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:41,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:41,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 09:21:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 09:21:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:41,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2025-03-03 09:21:41,060 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 74 [2025-03-03 09:21:41,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:41,060 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2025-03-03 09:21:41,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:41,060 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2025-03-03 09:21:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 09:21:41,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:41,060 INFO L218 NwaCegarLoop]: trace histogram [46, 18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 09:21:41,261 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-03 09:21:41,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:41,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1397843197, now seen corresponding path program 8 times [2025-03-03 09:21:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:41,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988390791] [2025-03-03 09:21:41,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:41,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-03 09:21:41,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 09:21:41,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:42,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988390791] [2025-03-03 09:21:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988390791] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408453919] [2025-03-03 09:21:42,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:21:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:42,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:42,704 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:42,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:21:42,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 98 statements into 2 equivalence classes. [2025-03-03 09:21:42,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 09:21:42,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:21:42,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:42,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-03 09:21:42,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:42,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 09:21:44,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408453919] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:44,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:44,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2025-03-03 09:21:44,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378538463] [2025-03-03 09:21:44,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:44,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2025-03-03 09:21:44,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:44,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2025-03-03 09:21:44,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 09:21:44,832 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 97 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:44,926 INFO L93 Difference]: Finished difference Result 157 states and 212 transitions. [2025-03-03 09:21:44,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-03 09:21:44,926 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 98 [2025-03-03 09:21:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:44,927 INFO L225 Difference]: With dead ends: 157 [2025-03-03 09:21:44,927 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 09:21:44,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 09:21:44,929 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:44,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:21:44,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 09:21:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2025-03-03 09:21:44,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0245901639344261) internal successors, (125), 122 states have internal predecessors, (125), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2025-03-03 09:21:44,938 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 98 [2025-03-03 09:21:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:44,939 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2025-03-03 09:21:44,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 1.175257731958763) internal successors, (114), 97 states have internal predecessors, (114), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2025-03-03 09:21:44,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 09:21:44,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:44,940 INFO L218 NwaCegarLoop]: trace histogram [94, 18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:44,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:21:45,140 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-03 09:21:45,141 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:45,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:45,141 INFO L85 PathProgramCache]: Analyzing trace with hash 317113341, now seen corresponding path program 9 times [2025-03-03 09:21:45,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:45,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813987624] [2025-03-03 09:21:45,141 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:45,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:45,181 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 146 statements into 48 equivalence classes. [2025-03-03 09:21:45,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 38 of 146 statements. [2025-03-03 09:21:45,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:21:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4739 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2025-03-03 09:21:45,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813987624] [2025-03-03 09:21:45,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813987624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:45,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853255033] [2025-03-03 09:21:45,281 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:21:45,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:45,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:45,283 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:45,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:21:45,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 146 statements into 48 equivalence classes. [2025-03-03 09:21:45,432 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 38 of 146 statements. [2025-03-03 09:21:45,432 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:21:45,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:45,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:21:45,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 4739 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2025-03-03 09:21:45,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4739 backedges. 102 proven. 21 refuted. 0 times theorem prover too weak. 4616 trivial. 0 not checked. [2025-03-03 09:21:45,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853255033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:45,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:45,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-03 09:21:45,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932480744] [2025-03-03 09:21:45,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:45,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-03 09:21:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:45,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-03 09:21:45,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:21:45,520 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:45,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:45,537 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2025-03-03 09:21:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 09:21:45,537 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 146 [2025-03-03 09:21:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:45,539 INFO L225 Difference]: With dead ends: 164 [2025-03-03 09:21:45,539 INFO L226 Difference]: Without dead ends: 135 [2025-03-03 09:21:45,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-03 09:21:45,539 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:45,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:21:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-03 09:21:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-03-03 09:21:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.023076923076923) internal successors, (133), 130 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2025-03-03 09:21:45,549 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 146 [2025-03-03 09:21:45,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:45,550 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2025-03-03 09:21:45,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0) internal successors, (34), 17 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:21:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2025-03-03 09:21:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 09:21:45,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:45,552 INFO L218 NwaCegarLoop]: trace histogram [94, 42, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:45,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:21:45,752 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-03 09:21:45,752 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:45,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:45,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2083280259, now seen corresponding path program 10 times [2025-03-03 09:21:45,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:45,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804695413] [2025-03-03 09:21:45,753 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:21:45,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:45,786 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-03-03 09:21:45,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:21:45,837 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:21:45,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-03-03 09:21:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:21:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804695413] [2025-03-03 09:21:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804695413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:21:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359535125] [2025-03-03 09:21:49,784 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:21:49,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:21:49,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:21:49,786 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:21:49,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:21:49,939 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 170 statements into 2 equivalence classes. [2025-03-03 09:21:50,041 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 09:21:50,041 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:21:50,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:21:50,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-03-03 09:21:50,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:21:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-03-03 09:21:50,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:21:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5519 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 1054 trivial. 0 not checked. [2025-03-03 09:21:56,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359535125] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:21:56,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:21:56,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2025-03-03 09:21:56,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439632312] [2025-03-03 09:21:56,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:21:56,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 193 states [2025-03-03 09:21:56,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:21:56,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2025-03-03 09:21:56,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-03-03 09:21:56,788 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand has 193 states, 193 states have (on average 1.0880829015544042) internal successors, (210), 193 states have internal predecessors, (210), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:57,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:21:57,036 INFO L93 Difference]: Finished difference Result 269 states and 372 transitions. [2025-03-03 09:21:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2025-03-03 09:21:57,036 INFO L78 Accepts]: Start accepts. Automaton has has 193 states, 193 states have (on average 1.0880829015544042) internal successors, (210), 193 states have internal predecessors, (210), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 170 [2025-03-03 09:21:57,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:21:57,037 INFO L225 Difference]: With dead ends: 269 [2025-03-03 09:21:57,037 INFO L226 Difference]: Without dead ends: 231 [2025-03-03 09:21:57,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2025-03-03 09:21:57,040 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:21:57,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:21:57,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2025-03-03 09:21:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2025-03-03 09:21:57,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 226 states have (on average 1.0132743362831858) internal successors, (229), 226 states have internal predecessors, (229), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:21:57,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2025-03-03 09:21:57,056 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 170 [2025-03-03 09:21:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:21:57,056 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2025-03-03 09:21:57,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 193 states, 193 states have (on average 1.0880829015544042) internal successors, (210), 193 states have internal predecessors, (210), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-03 09:21:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2025-03-03 09:21:57,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-03 09:21:57,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:21:57,058 INFO L218 NwaCegarLoop]: trace histogram [190, 42, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:21:57,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:21:57,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:21:57,259 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:21:57,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:21:57,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1164547971, now seen corresponding path program 11 times [2025-03-03 09:21:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:21:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642853824] [2025-03-03 09:21:57,259 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:21:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:21:57,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 266 statements into 96 equivalence classes. [2025-03-03 09:22:00,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) and asserted 255 of 266 statements. [2025-03-03 09:22:00,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 95 check-sat command(s) [2025-03-03 09:22:00,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:22:01,479 INFO L134 CoverageAnalysis]: Checked inductivity of 19199 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 18640 trivial. 0 not checked. [2025-03-03 09:22:01,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:22:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642853824] [2025-03-03 09:22:01,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642853824] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:22:01,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396902288] [2025-03-03 09:22:01,480 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:22:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:22:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:22:01,485 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:22:01,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:22:01,709 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 266 statements into 96 equivalence classes.