./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/max40-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/reducercommutativity/max40-1.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 a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:31:33,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:31:33,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:31:33,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:31:33,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:31:33,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:31:33,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:31:33,678 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:31:33,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:31:33,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:31:33,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:31:33,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:31:33,680 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:31:33,680 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:31:33,680 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:31:33,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:31:33,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:31:33,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:31:33,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:33,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:31:33,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:31:33,683 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 -> a8d5806586012290ae42296af495175d1f0a3275a3232981eda33ec55888f6d2 [2025-03-16 13:31:33,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:31:33,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:31:33,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:31:33,913 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:31:33,914 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:31:33,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max40-1.i [2025-03-16 13:31:35,052 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9682fa67/5ebf17aef262475aab2245a06532c64f/FLAG1fead5898 [2025-03-16 13:31:35,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:31:35,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max40-1.i [2025-03-16 13:31:35,271 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9682fa67/5ebf17aef262475aab2245a06532c64f/FLAG1fead5898 [2025-03-16 13:31:35,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9682fa67/5ebf17aef262475aab2245a06532c64f [2025-03-16 13:31:35,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:31:35,609 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:31:35,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:35,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:31:35,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:31:35,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7617332b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35, skipping insertion in model container [2025-03-16 13:31:35,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:31:35,725 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/reducercommutativity/max40-1.i[1290,1303] [2025-03-16 13:31:35,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:35,733 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:31:35,750 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/reducercommutativity/max40-1.i[1290,1303] [2025-03-16 13:31:35,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:31:35,760 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:31:35,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35 WrapperNode [2025-03-16 13:31:35,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:31:35,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:35,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:31:35,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:31:35,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,772 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,785 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-03-16 13:31:35,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:31:35,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:31:35,786 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:31:35,786 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:31:35,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,798 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 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-16 13:31:35,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,802 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,803 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:31:35,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:31:35,805 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:31:35,805 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:31:35,806 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (1/1) ... [2025-03-16 13:31:35,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:31:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:35,827 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-16 13:31:35,830 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-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-03-16 13:31:35,844 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:31:35,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:31:35,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:31:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:31:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:31:35,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:31:35,901 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:31:35,902 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:31:36,039 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: 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-16 13:31:36,051 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-03-16 13:31:36,051 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:31:36,060 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:31:36,060 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:31:36,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:36 BoogieIcfgContainer [2025-03-16 13:31:36,061 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:31:36,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:31:36,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:31:36,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:31:36,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:31:35" (1/3) ... [2025-03-16 13:31:36,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1346860e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:36, skipping insertion in model container [2025-03-16 13:31:36,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:31:35" (2/3) ... [2025-03-16 13:31:36,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1346860e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:31:36, skipping insertion in model container [2025-03-16 13:31:36,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:31:36" (3/3) ... [2025-03-16 13:31:36,068 INFO L128 eAbstractionObserver]: Analyzing ICFG max40-1.i [2025-03-16 13:31:36,078 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:31:36,080 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max40-1.i that has 2 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:31:36,112 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:31:36,119 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;@4da70f7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:31:36,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:31:36,122 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-16 13:31:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 13:31:36,126 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:36,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:36,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:36,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:36,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1091540240, now seen corresponding path program 1 times [2025-03-16 13:31:36,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:36,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943851228] [2025-03-16 13:31:36,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:36,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:36,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 13:31:36,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 13:31:36,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:36,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:36,325 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-16 13:31:36,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943851228] [2025-03-16 13:31:36,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943851228] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:36,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:31:36,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 13:31:36,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973418800] [2025-03-16 13:31:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:36,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:36,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:36,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:36,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 13:31:36,341 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 13:31:36,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:36,357 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2025-03-16 13:31:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23 [2025-03-16 13:31:36,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:36,362 INFO L225 Difference]: With dead ends: 43 [2025-03-16 13:31:36,362 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 13:31:36,364 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-16 13:31:36,366 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 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-16 13:31:36,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 13:31:36,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 13:31:36,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 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-16 13:31:36,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-16 13:31:36,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 23 [2025-03-16 13:31:36,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:36,387 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-16 13:31:36,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-16 13:31:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-16 13:31:36,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 13:31:36,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:36,388 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-16 13:31:36,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:31:36,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:36,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1726708840, now seen corresponding path program 1 times [2025-03-16 13:31:36,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:36,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467567002] [2025-03-16 13:31:36,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:36,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:36,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:31:36,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:31:36,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:36,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:36,475 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-16 13:31:36,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:36,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467567002] [2025-03-16 13:31:36,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467567002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:36,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560461466] [2025-03-16 13:31:36,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:36,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:36,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:36,478 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-16 13:31:36,479 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-16 13:31:36,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 13:31:36,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 13:31:36,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:36,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:36,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:31:36,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:36,588 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-16 13:31:36,589 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:31:36,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560461466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:36,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:31:36,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:31:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390591094] [2025-03-16 13:31:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:36,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:36,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:36,592 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 13:31:36,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:36,607 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2025-03-16 13:31:36,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:36,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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 24 [2025-03-16 13:31:36,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:36,608 INFO L225 Difference]: With dead ends: 37 [2025-03-16 13:31:36,608 INFO L226 Difference]: Without dead ends: 22 [2025-03-16 13:31:36,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-16 13:31:36,610 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:36,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 38 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-16 13:31:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-03-16 13:31:36,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 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-16 13:31:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2025-03-16 13:31:36,616 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 24 [2025-03-16 13:31:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:36,618 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2025-03-16 13:31:36,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-16 13:31:36,618 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2025-03-16 13:31:36,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-16 13:31:36,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:36,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:36,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 13:31:36,819 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-16 13:31:36,820 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:36,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:36,820 INFO L85 PathProgramCache]: Analyzing trace with hash 475225173, now seen corresponding path program 1 times [2025-03-16 13:31:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49338192] [2025-03-16 13:31:36,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:36,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:36,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:36,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:36,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:36,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-16 13:31:36,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49338192] [2025-03-16 13:31:36,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49338192] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:36,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143215122] [2025-03-16 13:31:36,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:36,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:36,927 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-16 13:31:36,929 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-16 13:31:36,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-16 13:31:37,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-16 13:31:37,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:37,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 13:31:37,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-16 13:31:37,033 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 13:31:37,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143215122] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:31:37,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 13:31:37,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 13:31:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361560289] [2025-03-16 13:31:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:31:37,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 13:31:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:37,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 13:31:37,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:31:37,035 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-16 13:31:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:37,045 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2025-03-16 13:31:37,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 13:31:37,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 33 [2025-03-16 13:31:37,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:37,046 INFO L225 Difference]: With dead ends: 33 [2025-03-16 13:31:37,046 INFO L226 Difference]: Without dead ends: 21 [2025-03-16 13:31:37,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-16 13:31:37,047 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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-16 13:31:37,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:37,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-16 13:31:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-16 13:31:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) 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-16 13:31:37,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2025-03-16 13:31:37,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 33 [2025-03-16 13:31:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:37,053 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2025-03-16 13:31:37,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-16 13:31:37,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2025-03-16 13:31:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 13:31:37,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:37,053 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:37,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 13:31:37,257 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-16 13:31:37,258 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1988187491, now seen corresponding path program 1 times [2025-03-16 13:31:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:37,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557290286] [2025-03-16 13:31:37,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:37,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:37,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 13:31:37,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:31:37,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:37,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,324 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:37,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557290286] [2025-03-16 13:31:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557290286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042287934] [2025-03-16 13:31:37,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:31:37,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:37,327 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-16 13:31:37,329 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-16 13:31:37,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 13:31:37,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 13:31:37,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:37,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:31:37,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:37,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:37,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042287934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:37,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:37,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2025-03-16 13:31:37,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396233220] [2025-03-16 13:31:37,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:37,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:31:37,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:31:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:31:37,461 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-16 13:31:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:37,474 INFO L93 Difference]: Finished difference Result 42 states and 54 transitions. [2025-03-16 13:31:37,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:31:37,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 34 [2025-03-16 13:31:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:37,475 INFO L225 Difference]: With dead ends: 42 [2025-03-16 13:31:37,475 INFO L226 Difference]: Without dead ends: 24 [2025-03-16 13:31:37,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 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-16 13:31:37,476 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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-16 13:31:37,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-03-16 13:31:37,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-03-16 13:31:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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-16 13:31:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-03-16 13:31:37,482 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 34 [2025-03-16 13:31:37,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:37,482 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-03-16 13:31:37,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-16 13:31:37,482 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-03-16 13:31:37,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 13:31:37,483 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:37,483 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:37,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 13:31:37,683 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-16 13:31:37,683 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:37,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1132745227, now seen corresponding path program 2 times [2025-03-16 13:31:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383675465] [2025-03-16 13:31:37,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:37,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:31:37,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:31:37,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:37,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-16 13:31:37,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383675465] [2025-03-16 13:31:37,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383675465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:37,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249071476] [2025-03-16 13:31:37,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:37,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:37,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:37,754 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-16 13:31:37,755 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-16 13:31:37,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 13:31:37,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 13:31:37,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:37,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:37,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:31:37,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:37,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-16 13:31:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249071476] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:37,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:37,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 7] total 14 [2025-03-16 13:31:37,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700635715] [2025-03-16 13:31:37,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:37,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:31:37,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:37,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:31:37,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:31:37,936 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-16 13:31:37,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:37,972 INFO L93 Difference]: Finished difference Result 53 states and 74 transitions. [2025-03-16 13:31:37,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-16 13:31:37,972 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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 37 [2025-03-16 13:31:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:37,973 INFO L225 Difference]: With dead ends: 53 [2025-03-16 13:31:37,973 INFO L226 Difference]: Without dead ends: 35 [2025-03-16 13:31:37,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 64 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-16 13:31:37,974 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:37,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-16 13:31:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2025-03-16 13:31:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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-16 13:31:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-03-16 13:31:37,980 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 37 [2025-03-16 13:31:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:37,980 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-03-16 13:31:37,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7857142857142856) internal successors, (39), 14 states have internal predecessors, (39), 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-16 13:31:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-03-16 13:31:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 13:31:37,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:37,982 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:37,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:38,186 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-16 13:31:38,186 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:38,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -191469340, now seen corresponding path program 3 times [2025-03-16 13:31:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258307471] [2025-03-16 13:31:38,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:38,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-16 13:31:38,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 52 statements. [2025-03-16 13:31:38,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:31:38,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:38,245 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 13:31:38,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258307471] [2025-03-16 13:31:38,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258307471] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:38,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498899329] [2025-03-16 13:31:38,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:38,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:38,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:38,249 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-16 13:31:38,251 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-16 13:31:38,296 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 52 statements into 6 equivalence classes. [2025-03-16 13:31:38,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 31 of 52 statements. [2025-03-16 13:31:38,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 13:31:38,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:38,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 13:31:38,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 40 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-16 13:31:38,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 13:31:38,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498899329] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:38,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:38,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-16 13:31:38,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668121164] [2025-03-16 13:31:38,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 13:31:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:38,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 13:31:38,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 13:31:38,352 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-16 13:31:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:38,367 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2025-03-16 13:31:38,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 13:31:38,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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 52 [2025-03-16 13:31:38,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:38,368 INFO L225 Difference]: With dead ends: 51 [2025-03-16 13:31:38,369 INFO L226 Difference]: Without dead ends: 36 [2025-03-16 13:31:38,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 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-16 13:31:38,369 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 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-16 13:31:38,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:38,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-16 13:31:38,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-16 13:31:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 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-16 13:31:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2025-03-16 13:31:38,377 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 52 [2025-03-16 13:31:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:38,378 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2025-03-16 13:31:38,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 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-16 13:31:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2025-03-16 13:31:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 13:31:38,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:38,378 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 6, 6, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:38,386 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-16 13:31:38,583 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-16 13:31:38,584 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:38,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:38,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1434208368, now seen corresponding path program 4 times [2025-03-16 13:31:38,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:38,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264829740] [2025-03-16 13:31:38,584 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:38,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:38,599 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-16 13:31:38,617 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 13:31:38,618 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:38,684 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 13:31:38,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264829740] [2025-03-16 13:31:38,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264829740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:38,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000654343] [2025-03-16 13:31:38,685 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:38,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:38,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:38,687 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-16 13:31:38,688 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-16 13:31:38,752 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 55 statements into 2 equivalence classes. [2025-03-16 13:31:38,783 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 13:31:38,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:38,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:38,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 13:31:38,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2025-03-16 13:31:38,797 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:38,832 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 13:31:38,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000654343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:38,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:38,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-16 13:31:38,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815315420] [2025-03-16 13:31:38,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:38,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 13:31:38,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:38,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 13:31:38,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 13:31:38,833 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:31:38,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:38,858 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2025-03-16 13:31:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 13:31:38,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 55 [2025-03-16 13:31:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:38,859 INFO L225 Difference]: With dead ends: 71 [2025-03-16 13:31:38,859 INFO L226 Difference]: Without dead ends: 48 [2025-03-16 13:31:38,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-16 13:31:38,860 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:38,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 59 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-16 13:31:38,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-16 13:31:38,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 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-16 13:31:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2025-03-16 13:31:38,867 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 55 [2025-03-16 13:31:38,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:38,868 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2025-03-16 13:31:38,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:31:38,868 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2025-03-16 13:31:38,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-16 13:31:38,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:38,869 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:38,875 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-16 13:31:39,069 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-16 13:31:39,070 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:39,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:39,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1580294960, now seen corresponding path program 5 times [2025-03-16 13:31:39,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:39,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855375068] [2025-03-16 13:31:39,071 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:39,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:39,091 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 91 statements into 14 equivalence classes. [2025-03-16 13:31:39,145 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 91 statements. [2025-03-16 13:31:39,145 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-16 13:31:39,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 123 proven. 174 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-16 13:31:39,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855375068] [2025-03-16 13:31:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855375068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:39,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236397683] [2025-03-16 13:31:39,295 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:39,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:39,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:39,297 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-16 13:31:39,299 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-16 13:31:39,361 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 91 statements into 14 equivalence classes. [2025-03-16 13:31:39,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) and asserted 81 of 91 statements. [2025-03-16 13:31:39,534 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2025-03-16 13:31:39,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:39,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 13:31:39,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 244 proven. 51 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2025-03-16 13:31:39,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-03-16 13:31:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236397683] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:39,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-16 13:31:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295844992] [2025-03-16 13:31:39,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:39,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 13:31:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:39,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 13:31:39,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-16 13:31:39,671 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:31:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:39,734 INFO L93 Difference]: Finished difference Result 107 states and 144 transitions. [2025-03-16 13:31:39,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-16 13:31:39,734 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2025-03-16 13:31:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:39,735 INFO L225 Difference]: With dead ends: 107 [2025-03-16 13:31:39,735 INFO L226 Difference]: Without dead ends: 72 [2025-03-16 13:31:39,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-16 13:31:39,736 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:39,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 118 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:31:39,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-16 13:31:39,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-16 13:31:39,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 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-16 13:31:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 90 transitions. [2025-03-16 13:31:39,741 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 90 transitions. Word has length 91 [2025-03-16 13:31:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:39,742 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 90 transitions. [2025-03-16 13:31:39,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-16 13:31:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2025-03-16 13:31:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-16 13:31:39,743 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:39,743 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:39,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:39,951 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-16 13:31:39,951 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:39,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash -442988720, now seen corresponding path program 6 times [2025-03-16 13:31:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:39,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677622531] [2025-03-16 13:31:39,952 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:31:39,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:39,973 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 163 statements into 30 equivalence classes. [2025-03-16 13:31:40,013 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 51 of 163 statements. [2025-03-16 13:31:40,014 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-16 13:31:40,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677622531] [2025-03-16 13:31:40,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677622531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:40,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015690568] [2025-03-16 13:31:40,122 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 13:31:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:40,125 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-16 13:31:40,126 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-16 13:31:40,206 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 163 statements into 30 equivalence classes. [2025-03-16 13:31:40,245 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 51 of 163 statements. [2025-03-16 13:31:40,245 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-16 13:31:40,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:40,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 13:31:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 1240 proven. 10 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2025-03-16 13:31:40,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2786 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:40,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015690568] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:40,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-16 13:31:40,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754197557] [2025-03-16 13:31:40,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:40,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-16 13:31:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:40,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-16 13:31:40,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:31:40,328 INFO L87 Difference]: Start difference. First operand 72 states and 90 transitions. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-16 13:31:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:40,348 INFO L93 Difference]: Finished difference Result 129 states and 167 transitions. [2025-03-16 13:31:40,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 13:31:40,349 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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 163 [2025-03-16 13:31:40,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:40,349 INFO L225 Difference]: With dead ends: 129 [2025-03-16 13:31:40,349 INFO L226 Difference]: Without dead ends: 78 [2025-03-16 13:31:40,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-16 13:31:40,350 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:40,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-16 13:31:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-16 13:31:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.2328767123287672) internal successors, (90), 73 states have internal predecessors, (90), 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-16 13:31:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2025-03-16 13:31:40,357 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 163 [2025-03-16 13:31:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:40,358 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2025-03-16 13:31:40,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 13 states have internal predecessors, (33), 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-16 13:31:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2025-03-16 13:31:40,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-16 13:31:40,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:40,362 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 10, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:40,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-16 13:31:40,562 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-16 13:31:40,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:40,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:40,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1217935664, now seen corresponding path program 7 times [2025-03-16 13:31:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802507029] [2025-03-16 13:31:40,563 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:31:40,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:40,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 13:31:40,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 13:31:40,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:40,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:40,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802507029] [2025-03-16 13:31:40,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802507029] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:40,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064284156] [2025-03-16 13:31:40,964 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 13:31:40,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:40,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:40,966 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-16 13:31:40,968 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-16 13:31:41,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-16 13:31:41,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-16 13:31:41,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:31:41,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:41,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 787 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-16 13:31:41,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:41,154 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2831 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:41,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064284156] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:41,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:41,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 25 [2025-03-16 13:31:41,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907851897] [2025-03-16 13:31:41,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:41,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:31:41,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:41,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:31:41,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:31:41,348 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-16 13:31:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:41,374 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2025-03-16 13:31:41,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:31:41,375 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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 169 [2025-03-16 13:31:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:41,376 INFO L225 Difference]: With dead ends: 156 [2025-03-16 13:31:41,376 INFO L226 Difference]: Without dead ends: 90 [2025-03-16 13:31:41,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 326 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-16 13:31:41,377 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:41,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-16 13:31:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-03-16 13:31:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2) internal successors, (102), 85 states have internal predecessors, (102), 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-16 13:31:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2025-03-16 13:31:41,385 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 169 [2025-03-16 13:31:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:41,385 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2025-03-16 13:31:41,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-16 13:31:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2025-03-16 13:31:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-16 13:31:41,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:41,387 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 22, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:41,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-16 13:31:41,587 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-16 13:31:41,588 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:41,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1962670896, now seen corresponding path program 8 times [2025-03-16 13:31:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433479113] [2025-03-16 13:31:41,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:41,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:41,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-16 13:31:41,650 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 13:31:41,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433479113] [2025-03-16 13:31:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433479113] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853898905] [2025-03-16 13:31:42,356 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:31:42,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:42,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:42,358 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-16 13:31:42,360 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-16 13:31:42,456 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 181 statements into 2 equivalence classes. [2025-03-16 13:31:42,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 181 of 181 statements. [2025-03-16 13:31:42,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:31:42,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:42,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-16 13:31:42,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:42,578 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 3029 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2025-03-16 13:31:43,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853898905] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:43,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:43,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 25] total 43 [2025-03-16 13:31:43,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030453372] [2025-03-16 13:31:43,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-16 13:31:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:43,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-16 13:31:43,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 13:31:43,080 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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-16 13:31:43,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:43,133 INFO L93 Difference]: Finished difference Result 174 states and 227 transitions. [2025-03-16 13:31:43,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-16 13:31:43,134 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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 181 [2025-03-16 13:31:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:43,136 INFO L225 Difference]: With dead ends: 174 [2025-03-16 13:31:43,136 INFO L226 Difference]: Without dead ends: 108 [2025-03-16 13:31:43,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 338 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2025-03-16 13:31:43,138 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:43,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-16 13:31:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-16 13:31:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.1650485436893203) internal successors, (120), 103 states have internal predecessors, (120), 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-16 13:31:43,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2025-03-16 13:31:43,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 181 [2025-03-16 13:31:43,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:43,147 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2025-03-16 13:31:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 43 states have internal predecessors, (64), 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-16 13:31:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2025-03-16 13:31:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-16 13:31:43,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:43,148 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 40, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:43,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:43,349 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-16 13:31:43,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:43,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:43,349 INFO L85 PathProgramCache]: Analyzing trace with hash -864419376, now seen corresponding path program 9 times [2025-03-16 13:31:43,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:43,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306803387] [2025-03-16 13:31:43,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:43,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:43,378 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 199 statements into 30 equivalence classes. [2025-03-16 13:31:43,433 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 72 of 199 statements. [2025-03-16 13:31:43,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 13:31:43,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3541 trivial. 0 not checked. [2025-03-16 13:31:43,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:43,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306803387] [2025-03-16 13:31:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306803387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457694238] [2025-03-16 13:31:43,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:31:43,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:43,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:43,633 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-16 13:31:43,634 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-16 13:31:43,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 199 statements into 30 equivalence classes. [2025-03-16 13:31:44,016 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 72 of 199 statements. [2025-03-16 13:31:44,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-03-16 13:31:44,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:44,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-16 13:31:44,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:44,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 1240 proven. 55 refuted. 0 times theorem prover too weak. 2301 trivial. 0 not checked. [2025-03-16 13:31:44,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3596 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 3541 trivial. 0 not checked. [2025-03-16 13:31:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457694238] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:44,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:44,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-03-16 13:31:44,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944519966] [2025-03-16 13:31:44,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:44,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-16 13:31:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:44,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-16 13:31:44,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2025-03-16 13:31:44,225 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-16 13:31:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:44,251 INFO L93 Difference]: Finished difference Result 171 states and 215 transitions. [2025-03-16 13:31:44,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 13:31:44,251 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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 199 [2025-03-16 13:31:44,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:44,252 INFO L225 Difference]: With dead ends: 171 [2025-03-16 13:31:44,252 INFO L226 Difference]: Without dead ends: 120 [2025-03-16 13:31:44,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 386 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-16 13:31:44,253 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:44,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:31:44,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-16 13:31:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2025-03-16 13:31:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.1478260869565218) internal successors, (132), 115 states have internal predecessors, (132), 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-16 13:31:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 138 transitions. [2025-03-16 13:31:44,272 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 138 transitions. Word has length 199 [2025-03-16 13:31:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:44,272 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 138 transitions. [2025-03-16 13:31:44,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 states have internal predecessors, (45), 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-16 13:31:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 138 transitions. [2025-03-16 13:31:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 13:31:44,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:44,273 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 42, 40, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:44,281 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-16 13:31:44,474 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-16 13:31:44,474 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash 497492176, now seen corresponding path program 10 times [2025-03-16 13:31:44,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:44,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337184177] [2025-03-16 13:31:44,475 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:44,503 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 211 statements into 2 equivalence classes. [2025-03-16 13:31:44,538 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 13:31:44,538 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:44,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3794 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2269 trivial. 0 not checked. [2025-03-16 13:31:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337184177] [2025-03-16 13:31:44,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337184177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275435494] [2025-03-16 13:31:44,921 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 13:31:44,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:44,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:44,923 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-16 13:31:44,925 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-16 13:31:45,062 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 211 statements into 2 equivalence classes. [2025-03-16 13:31:45,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 13:31:45,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-16 13:31:45,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:45,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1141 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 13:31:45,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:31:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3794 backedges. 1236 proven. 287 refuted. 0 times theorem prover too weak. 2271 trivial. 0 not checked. [2025-03-16 13:31:45,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:31:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3794 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 2269 trivial. 0 not checked. [2025-03-16 13:31:45,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275435494] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:31:45,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:31:45,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 32 [2025-03-16 13:31:45,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892938899] [2025-03-16 13:31:45,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:31:45,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-16 13:31:45,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:31:45,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-16 13:31:45,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-16 13:31:45,526 INFO L87 Difference]: Start difference. First operand 120 states and 138 transitions. Second operand has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:31:45,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:31:45,621 INFO L93 Difference]: Finished difference Result 245 states and 314 transitions. [2025-03-16 13:31:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-16 13:31:45,622 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 211 [2025-03-16 13:31:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:31:45,623 INFO L225 Difference]: With dead ends: 245 [2025-03-16 13:31:45,623 INFO L226 Difference]: Without dead ends: 168 [2025-03-16 13:31:45,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2025-03-16 13:31:45,623 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 99 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:31:45,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 100 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:31:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-16 13:31:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-03-16 13:31:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 163 states have (on average 1.2024539877300613) internal successors, (196), 163 states have internal predecessors, (196), 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-16 13:31:45,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2025-03-16 13:31:45,637 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 211 [2025-03-16 13:31:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:31:45,637 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2025-03-16 13:31:45,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.4375) internal successors, (110), 32 states have internal predecessors, (110), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 13:31:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2025-03-16 13:31:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 13:31:45,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:31:45,639 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 40, 22, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:31:45,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-16 13:31:45,844 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-16 13:31:45,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:31:45,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:31:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash -90212912, now seen corresponding path program 11 times [2025-03-16 13:31:45,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:31:45,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740321546] [2025-03-16 13:31:45,845 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:31:45,881 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 355 statements into 62 equivalence classes. [2025-03-16 13:31:47,016 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) and asserted 345 of 355 statements. [2025-03-16 13:31:47,017 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2025-03-16 13:31:47,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:31:48,096 INFO L134 CoverageAnalysis]: Checked inductivity of 13370 backedges. 2763 proven. 4098 refuted. 0 times theorem prover too weak. 6509 trivial. 0 not checked. [2025-03-16 13:31:48,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:31:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740321546] [2025-03-16 13:31:48,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740321546] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:31:48,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799164002] [2025-03-16 13:31:48,096 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 13:31:48,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:31:48,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:31:48,098 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-16 13:31:48,100 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-16 13:31:48,281 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 355 statements into 62 equivalence classes.