./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:34:54,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:34:54,637 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:34:54,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:34:54,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:34:54,669 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:34:54,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:34:54,671 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:34:54,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:34:54,671 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:34:54,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:34:54,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:34:54,672 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:34:54,672 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:34:54,672 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:34:54,673 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:34:54,673 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:34:54,674 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:34:54,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:34:54,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:34:54,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:34:54,676 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 -> 52a248b2b2cf395cf0c12ea6447af889ed3691d7fa3d2de2504a7728d19c705b [2025-03-08 00:34:54,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:34:54,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:34:54,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:34:54,915 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:34:54,915 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:34:54,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2025-03-08 00:34:56,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5012b1a98/0a495f5f97574ba0ae7dce64c0a4b888/FLAGefce6e6d4 [2025-03-08 00:34:56,238 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:34:56,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c [2025-03-08 00:34:56,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5012b1a98/0a495f5f97574ba0ae7dce64c0a4b888/FLAGefce6e6d4 [2025-03-08 00:34:56,620 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5012b1a98/0a495f5f97574ba0ae7dce64c0a4b888 [2025-03-08 00:34:56,622 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:34:56,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:34:56,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:34:56,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:34:56,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:34:56,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad3d11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56, skipping insertion in model container [2025-03-08 00:34:56,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:34:56,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c[414,427] [2025-03-08 00:34:56,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:34:56,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:34:56,795 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-multidimensional/copy-partial-3-u.c[414,427] [2025-03-08 00:34:56,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:34:56,816 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:34:56,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56 WrapperNode [2025-03-08 00:34:56,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:34:56,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:34:56,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:34:56,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:34:56,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,841 INFO L138 Inliner]: procedures = 15, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2025-03-08 00:34:56,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:34:56,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:34:56,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:34:56,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:34:56,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,858 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 3, 4]. 44 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2025-03-08 00:34:56,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,861 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,866 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:34:56,867 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:34:56,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:34:56,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:34:56,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (1/1) ... [2025-03-08 00:34:56,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:34:56,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:56,891 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:34:56,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:34:56,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:34:56,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:34:56,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:34:56,956 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:34:56,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:34:57,135 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset; [2025-03-08 00:34:57,152 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 00:34:57,152 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:34:57,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:34:57,160 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:34:57,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:34:57 BoogieIcfgContainer [2025-03-08 00:34:57,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:34:57,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:34:57,164 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:34:57,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:34:57,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:34:56" (1/3) ... [2025-03-08 00:34:57,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a08867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:34:57, skipping insertion in model container [2025-03-08 00:34:57,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:34:56" (2/3) ... [2025-03-08 00:34:57,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a08867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:34:57, skipping insertion in model container [2025-03-08 00:34:57,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:34:57" (3/3) ... [2025-03-08 00:34:57,170 INFO L128 eAbstractionObserver]: Analyzing ICFG copy-partial-3-u.c [2025-03-08 00:34:57,181 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:34:57,182 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG copy-partial-3-u.c that has 1 procedures, 23 locations, 1 initial locations, 12 loop locations, and 1 error locations. [2025-03-08 00:34:57,219 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:34:57,226 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;@109adeb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:34:57,226 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:34:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:34:57,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:57,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:57,233 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:57,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:57,236 INFO L85 PathProgramCache]: Analyzing trace with hash -269283594, now seen corresponding path program 1 times [2025-03-08 00:34:57,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:57,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710618544] [2025-03-08 00:34:57,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:57,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:57,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:34:57,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:34:57,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:57,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:34:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:57,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710618544] [2025-03-08 00:34:57,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710618544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:57,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:34:57,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818704033] [2025-03-08 00:34:57,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:34:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:57,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:34:57,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:34:57,388 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:57,398 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2025-03-08 00:34:57,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:34:57,399 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:34:57,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:57,403 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:34:57,403 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:34:57,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:34:57,407 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:57,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:57,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:34:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:34:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2025-03-08 00:34:57,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 31 transitions. Word has length 12 [2025-03-08 00:34:57,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:57,429 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 31 transitions. [2025-03-08 00:34:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 31 transitions. [2025-03-08 00:34:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-08 00:34:57,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:57,430 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:57,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:34:57,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:57,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -465797099, now seen corresponding path program 1 times [2025-03-08 00:34:57,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:57,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225587422] [2025-03-08 00:34:57,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:57,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:57,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-08 00:34:57,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-08 00:34:57,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:57,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:57,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:34:57,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:57,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225587422] [2025-03-08 00:34:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225587422] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:57,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:57,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527706840] [2025-03-08 00:34:57,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:57,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:57,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:57,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,564 INFO L87 Difference]: Start difference. First operand 20 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:57,639 INFO L93 Difference]: Finished difference Result 46 states and 73 transitions. [2025-03-08 00:34:57,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:57,640 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-08 00:34:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:57,641 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:34:57,641 INFO L226 Difference]: Without dead ends: 33 [2025-03-08 00:34:57,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,642 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:57,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 19 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:34:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-08 00:34:57,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2025-03-08 00:34:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2025-03-08 00:34:57,646 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 12 [2025-03-08 00:34:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:57,647 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2025-03-08 00:34:57,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,647 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2025-03-08 00:34:57,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:34:57,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:57,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:57,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:34:57,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:57,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:57,648 INFO L85 PathProgramCache]: Analyzing trace with hash -288616303, now seen corresponding path program 1 times [2025-03-08 00:34:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275635208] [2025-03-08 00:34:57,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:57,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:57,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:34:57,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:34:57,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:57,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:34:57,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275635208] [2025-03-08 00:34:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275635208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:57,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:57,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:57,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414052309] [2025-03-08 00:34:57,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:57,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:57,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:57,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:57,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,748 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:57,793 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2025-03-08 00:34:57,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:57,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-08 00:34:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:57,795 INFO L225 Difference]: With dead ends: 47 [2025-03-08 00:34:57,795 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:34:57,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,796 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:57,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:57,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:34:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2025-03-08 00:34:57,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 22 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 34 transitions. [2025-03-08 00:34:57,802 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 34 transitions. Word has length 14 [2025-03-08 00:34:57,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:57,803 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 34 transitions. [2025-03-08 00:34:57,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,804 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2025-03-08 00:34:57,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 00:34:57,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:57,804 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:57,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:34:57,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:57,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:57,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1972057843, now seen corresponding path program 1 times [2025-03-08 00:34:57,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:57,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444570334] [2025-03-08 00:34:57,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:57,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:57,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 00:34:57,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 00:34:57,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:57,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:34:57,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:57,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444570334] [2025-03-08 00:34:57,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444570334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:57,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:57,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:57,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405008436] [2025-03-08 00:34:57,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:57,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:57,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:57,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:57,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,885 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:57,930 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2025-03-08 00:34:57,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:57,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-08 00:34:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:57,930 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:34:57,930 INFO L226 Difference]: Without dead ends: 30 [2025-03-08 00:34:57,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:57,931 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:57,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 20 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-08 00:34:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-03-08 00:34:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2025-03-08 00:34:57,936 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 36 transitions. Word has length 16 [2025-03-08 00:34:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:57,936 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 36 transitions. [2025-03-08 00:34:57,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 36 transitions. [2025-03-08 00:34:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 00:34:57,936 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:57,936 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:34:57,936 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:57,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:57,937 INFO L85 PathProgramCache]: Analyzing trace with hash 129898295, now seen corresponding path program 1 times [2025-03-08 00:34:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311539471] [2025-03-08 00:34:57,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:57,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:57,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 00:34:57,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 00:34:57,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:57,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:34:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311539471] [2025-03-08 00:34:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311539471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648283383] [2025-03-08 00:34:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,005 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,062 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2025-03-08 00:34:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 00:34:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,064 INFO L225 Difference]: With dead ends: 53 [2025-03-08 00:34:58,064 INFO L226 Difference]: Without dead ends: 41 [2025-03-08 00:34:58,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,066 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-08 00:34:58,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2025-03-08 00:34:58,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2025-03-08 00:34:58,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2025-03-08 00:34:58,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,074 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2025-03-08 00:34:58,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,074 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2025-03-08 00:34:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 00:34:58,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:34:58,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1122399035, now seen corresponding path program 1 times [2025-03-08 00:34:58,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319221887] [2025-03-08 00:34:58,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 00:34:58,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 00:34:58,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:34:58,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319221887] [2025-03-08 00:34:58,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319221887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575232365] [2025-03-08 00:34:58,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,138 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,193 INFO L93 Difference]: Finished difference Result 51 states and 74 transitions. [2025-03-08 00:34:58,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-08 00:34:58,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,194 INFO L225 Difference]: With dead ends: 51 [2025-03-08 00:34:58,194 INFO L226 Difference]: Without dead ends: 36 [2025-03-08 00:34:58,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,194 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 31 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-08 00:34:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2025-03-08 00:34:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2025-03-08 00:34:58,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 19 [2025-03-08 00:34:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,206 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2025-03-08 00:34:58,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2025-03-08 00:34:58,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 00:34:58,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,207 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:34:58,207 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1970726041, now seen corresponding path program 1 times [2025-03-08 00:34:58,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901580916] [2025-03-08 00:34:58,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 00:34:58,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 00:34:58,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:34:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901580916] [2025-03-08 00:34:58,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901580916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149591303] [2025-03-08 00:34:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,270 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,303 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2025-03-08 00:34:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-08 00:34:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,304 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:34:58,304 INFO L226 Difference]: Without dead ends: 32 [2025-03-08 00:34:58,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,305 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-08 00:34:58,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2025-03-08 00:34:58,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2025-03-08 00:34:58,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 21 [2025-03-08 00:34:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,315 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2025-03-08 00:34:58,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2025-03-08 00:34:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 00:34:58,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,316 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:34:58,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1761446709, now seen corresponding path program 1 times [2025-03-08 00:34:58,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124989851] [2025-03-08 00:34:58,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 00:34:58,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 00:34:58,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124989851] [2025-03-08 00:34:58,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124989851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399596232] [2025-03-08 00:34:58,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,398 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,443 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2025-03-08 00:34:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-03-08 00:34:58,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,444 INFO L225 Difference]: With dead ends: 40 [2025-03-08 00:34:58,444 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:34:58,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:34:58,445 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 15 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:34:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2025-03-08 00:34:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2025-03-08 00:34:58,450 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 22 [2025-03-08 00:34:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,450 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2025-03-08 00:34:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2025-03-08 00:34:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:34:58,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,451 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 00:34:58,451 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1803472207, now seen corresponding path program 1 times [2025-03-08 00:34:58,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089095174] [2025-03-08 00:34:58,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:34:58,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:34:58,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089095174] [2025-03-08 00:34:58,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089095174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791389212] [2025-03-08 00:34:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,507 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,555 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2025-03-08 00:34:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-03-08 00:34:58,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,556 INFO L225 Difference]: With dead ends: 43 [2025-03-08 00:34:58,556 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:34:58,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:34:58,556 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 16 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:34:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2025-03-08 00:34:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2025-03-08 00:34:58,564 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 24 [2025-03-08 00:34:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,564 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2025-03-08 00:34:58,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,564 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2025-03-08 00:34:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:34:58,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:34:58,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1927459219, now seen corresponding path program 1 times [2025-03-08 00:34:58,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032697602] [2025-03-08 00:34:58,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 00:34:58,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:34:58,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032697602] [2025-03-08 00:34:58,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032697602] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:34:58,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:34:58,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 00:34:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926343034] [2025-03-08 00:34:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:34:58,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:34:58,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:34:58,610 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,653 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2025-03-08 00:34:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:34:58,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 00:34:58,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,654 INFO L225 Difference]: With dead ends: 44 [2025-03-08 00:34:58,654 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:34:58,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:34:58,654 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:34:58,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:34:58,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-08 00:34:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2025-03-08 00:34:58,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 26 [2025-03-08 00:34:58,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,664 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2025-03-08 00:34:58,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,664 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2025-03-08 00:34:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:34:58,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,665 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:34:58,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:58,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash 474137623, now seen corresponding path program 1 times [2025-03-08 00:34:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:58,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486163561] [2025-03-08 00:34:58,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:58,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:34:58,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:34:58,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486163561] [2025-03-08 00:34:58,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486163561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:58,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071304835] [2025-03-08 00:34:58,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:34:58,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:58,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:34:58,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:34:58,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:34:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:34:58,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:34:58,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:34:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:58,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:58,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:58,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071304835] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:34:58,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:34:58,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:34:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103374217] [2025-03-08 00:34:58,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:34:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:34:58,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:58,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:34:58,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:34:58,891 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:34:58,981 INFO L93 Difference]: Finished difference Result 78 states and 109 transitions. [2025-03-08 00:34:58,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:34:58,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-08 00:34:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:34:58,982 INFO L225 Difference]: With dead ends: 78 [2025-03-08 00:34:58,982 INFO L226 Difference]: Without dead ends: 52 [2025-03-08 00:34:58,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:34:58,985 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 77 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:34:58,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 34 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:34:58,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-08 00:34:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2025-03-08 00:34:58,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 42 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-03-08 00:34:58,999 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 27 [2025-03-08 00:34:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:34:58,999 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-03-08 00:34:58,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:34:58,999 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-03-08 00:34:58,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:34:58,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:34:58,999 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:34:59,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 00:34:59,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:34:59,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:34:59,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:34:59,202 INFO L85 PathProgramCache]: Analyzing trace with hash 147266003, now seen corresponding path program 2 times [2025-03-08 00:34:59,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:34:59,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424226476] [2025-03-08 00:34:59,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:34:59,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:34:59,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:34:59,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:34:59,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:34:59,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:59,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 00:34:59,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:34:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424226476] [2025-03-08 00:34:59,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424226476] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:34:59,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580173993] [2025-03-08 00:34:59,291 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:34:59,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:34:59,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:34:59,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:34:59,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:34:59,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:34:59,364 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:34:59,364 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:34:59,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:34:59,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:34:59,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:34:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:59,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:34:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 00:34:59,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580173993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:34:59,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:34:59,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 16 [2025-03-08 00:34:59,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910059216] [2025-03-08 00:34:59,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:34:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:34:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:34:59,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:34:59,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2025-03-08 00:34:59,511 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:00,169 INFO L93 Difference]: Finished difference Result 299 states and 403 transitions. [2025-03-08 00:35:00,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 00:35:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-03-08 00:35:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:00,171 INFO L225 Difference]: With dead ends: 299 [2025-03-08 00:35:00,171 INFO L226 Difference]: Without dead ends: 261 [2025-03-08 00:35:00,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=629, Invalid=1093, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 00:35:00,173 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 843 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:00,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 56 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:35:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-03-08 00:35:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 81. [2025-03-08 00:35:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2875) internal successors, (103), 80 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2025-03-08 00:35:00,200 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 30 [2025-03-08 00:35:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:00,200 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2025-03-08 00:35:00,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.9375) internal successors, (47), 16 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,202 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2025-03-08 00:35:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-08 00:35:00,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:00,203 INFO L218 NwaCegarLoop]: trace histogram [20, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:00,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:35:00,403 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,SelfDestructingSolverStorable11 [2025-03-08 00:35:00,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:00,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:00,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1781327183, now seen corresponding path program 3 times [2025-03-08 00:35:00,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:00,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062112335] [2025-03-08 00:35:00,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:35:00,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:00,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 15 equivalence classes. [2025-03-08 00:35:00,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 50 statements. [2025-03-08 00:35:00,434 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:35:00,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 00:35:00,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062112335] [2025-03-08 00:35:00,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062112335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815316115] [2025-03-08 00:35:00,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:35:00,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:00,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:00,474 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:00,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:35:00,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 50 statements into 15 equivalence classes. [2025-03-08 00:35:00,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 50 statements. [2025-03-08 00:35:00,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-08 00:35:00,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:00,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:35:00,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 00:35:00,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 00:35:00,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815316115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:00,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:00,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:35:00,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136635432] [2025-03-08 00:35:00,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:00,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:35:00,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:00,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:35:00,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:35:00,683 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:00,827 INFO L93 Difference]: Finished difference Result 323 states and 420 transitions. [2025-03-08 00:35:00,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:35:00,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2025-03-08 00:35:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:00,829 INFO L225 Difference]: With dead ends: 323 [2025-03-08 00:35:00,829 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 00:35:00,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:35:00,830 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:00,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 73 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:35:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 00:35:00,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 96. [2025-03-08 00:35:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2025-03-08 00:35:00,853 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 50 [2025-03-08 00:35:00,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:00,853 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2025-03-08 00:35:00,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2025-03-08 00:35:00,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 00:35:00,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:00,854 INFO L218 NwaCegarLoop]: trace histogram [20, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:00,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 00:35:01,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:01,058 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:01,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2000548357, now seen corresponding path program 4 times [2025-03-08 00:35:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34036636] [2025-03-08 00:35:01,059 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:35:01,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:01,081 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-08 00:35:01,094 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 65 statements. [2025-03-08 00:35:01,094 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:35:01,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:01,158 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:35:01,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34036636] [2025-03-08 00:35:01,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34036636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:01,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984104470] [2025-03-08 00:35:01,159 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:35:01,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:01,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:01,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:01,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:35:01,223 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-03-08 00:35:01,240 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 65 statements. [2025-03-08 00:35:01,240 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:35:01,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:01,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:35:01,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 128 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:35:01,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 127 proven. 2 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-08 00:35:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984104470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:01,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-08 00:35:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405192403] [2025-03-08 00:35:01,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:01,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:35:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:01,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:35:01,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:35:01,325 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:01,425 INFO L93 Difference]: Finished difference Result 309 states and 403 transitions. [2025-03-08 00:35:01,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:35:01,426 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-08 00:35:01,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:01,427 INFO L225 Difference]: With dead ends: 309 [2025-03-08 00:35:01,427 INFO L226 Difference]: Without dead ends: 230 [2025-03-08 00:35:01,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:35:01,428 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:01,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 38 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:35:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-08 00:35:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 153. [2025-03-08 00:35:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 152 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 195 transitions. [2025-03-08 00:35:01,450 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 195 transitions. Word has length 65 [2025-03-08 00:35:01,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:01,450 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 195 transitions. [2025-03-08 00:35:01,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:01,450 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 195 transitions. [2025-03-08 00:35:01,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-08 00:35:01,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:01,451 INFO L218 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:01,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 00:35:01,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:01,655 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:01,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash 373704153, now seen corresponding path program 5 times [2025-03-08 00:35:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105214982] [2025-03-08 00:35:01,655 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:35:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:01,675 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 20 equivalence classes. [2025-03-08 00:35:01,776 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 77 statements. [2025-03-08 00:35:01,776 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-08 00:35:01,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 297 proven. 168 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-08 00:35:02,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105214982] [2025-03-08 00:35:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105214982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:02,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424220913] [2025-03-08 00:35:02,108 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:35:02,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:02,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:02,110 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:02,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:35:02,177 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 77 statements into 20 equivalence classes. [2025-03-08 00:35:49,218 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) and asserted 59 of 77 statements. [2025-03-08 00:35:49,219 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2025-03-08 00:35:49,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:49,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-08 00:35:49,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:49,412 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 292 proven. 103 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-08 00:35:49,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:49,562 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 262 proven. 133 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-08 00:35:49,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424220913] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:49,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:49,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 32 [2025-03-08 00:35:49,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632385653] [2025-03-08 00:35:49,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-08 00:35:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:49,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-08 00:35:49,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:35:49,564 INFO L87 Difference]: Start difference. First operand 153 states and 195 transitions. Second operand has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:53,708 INFO L93 Difference]: Finished difference Result 985 states and 1230 transitions. [2025-03-08 00:35:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2025-03-08 00:35:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2025-03-08 00:35:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:53,710 INFO L225 Difference]: With dead ends: 985 [2025-03-08 00:35:53,711 INFO L226 Difference]: Without dead ends: 862 [2025-03-08 00:35:53,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29168 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=11246, Invalid=59776, Unknown=0, NotChecked=0, Total=71022 [2025-03-08 00:35:53,726 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 2513 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2513 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:53,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2513 Valid, 399 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 00:35:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-08 00:35:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 307. [2025-03-08 00:35:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.2679738562091503) internal successors, (388), 306 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 388 transitions. [2025-03-08 00:35:53,771 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 388 transitions. Word has length 77 [2025-03-08 00:35:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:53,771 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 388 transitions. [2025-03-08 00:35:53,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.40625) internal successors, (109), 32 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 388 transitions. [2025-03-08 00:35:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-03-08 00:35:53,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:53,772 INFO L218 NwaCegarLoop]: trace histogram [80, 12, 8, 8, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:53,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 00:35:53,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-08 00:35:53,973 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:53,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash -445192129, now seen corresponding path program 6 times [2025-03-08 00:35:53,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:53,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710280434] [2025-03-08 00:35:53,974 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:35:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:54,012 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 51 equivalence classes. [2025-03-08 00:35:54,022 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 152 statements. [2025-03-08 00:35:54,022 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:35:54,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-03-08 00:35:54,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710280434] [2025-03-08 00:35:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710280434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784561485] [2025-03-08 00:35:54,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:35:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:54,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:54,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:35:54,164 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 152 statements into 51 equivalence classes. [2025-03-08 00:35:54,176 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 20 of 152 statements. [2025-03-08 00:35:54,176 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 00:35:54,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:54,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 00:35:54,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-03-08 00:35:54,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:54,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4053 trivial. 0 not checked. [2025-03-08 00:35:54,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784561485] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:54,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:54,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-08 00:35:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000933155] [2025-03-08 00:35:54,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:35:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:54,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:35:54,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:35:54,613 INFO L87 Difference]: Start difference. First operand 307 states and 388 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:54,800 INFO L93 Difference]: Finished difference Result 1066 states and 1376 transitions. [2025-03-08 00:35:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:35:54,801 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2025-03-08 00:35:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:54,803 INFO L225 Difference]: With dead ends: 1066 [2025-03-08 00:35:54,803 INFO L226 Difference]: Without dead ends: 864 [2025-03-08 00:35:54,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:35:54,804 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 318 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:54,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 25 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:35:54,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2025-03-08 00:35:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 467. [2025-03-08 00:35:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.2231759656652361) internal successors, (570), 466 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 570 transitions. [2025-03-08 00:35:54,900 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 570 transitions. Word has length 152 [2025-03-08 00:35:54,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:54,900 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 570 transitions. [2025-03-08 00:35:54,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 570 transitions. [2025-03-08 00:35:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-03-08 00:35:54,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:54,902 INFO L218 NwaCegarLoop]: trace histogram [160, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:54,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 00:35:55,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 00:35:55,103 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:55,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1698122029, now seen corresponding path program 7 times [2025-03-08 00:35:55,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:55,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964300866] [2025-03-08 00:35:55,104 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:35:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:55,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 00:35:55,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 00:35:55,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:55,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:56,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-03-08 00:35:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964300866] [2025-03-08 00:35:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964300866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070738625] [2025-03-08 00:35:56,039 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:35:56,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:56,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:56,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:35:56,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-03-08 00:35:56,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-03-08 00:35:56,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:35:56,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:56,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 2179 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 00:35:56,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:35:56,593 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-03-08 00:35:56,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:35:56,741 INFO L134 CoverageAnalysis]: Checked inductivity of 17566 backedges. 1838 proven. 55 refuted. 0 times theorem prover too weak. 15673 trivial. 0 not checked. [2025-03-08 00:35:56,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070738625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:35:56,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:35:56,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 37 [2025-03-08 00:35:56,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043569924] [2025-03-08 00:35:56,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:35:56,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 00:35:56,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:35:56,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 00:35:56,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=753, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:35:56,743 INFO L87 Difference]: Start difference. First operand 467 states and 570 transitions. Second operand has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:35:57,294 INFO L93 Difference]: Finished difference Result 1463 states and 2103 transitions. [2025-03-08 00:35:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 00:35:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2025-03-08 00:35:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:35:57,298 INFO L225 Difference]: With dead ends: 1463 [2025-03-08 00:35:57,298 INFO L226 Difference]: Without dead ends: 1013 [2025-03-08 00:35:57,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=876, Invalid=1380, Unknown=0, NotChecked=0, Total=2256 [2025-03-08 00:35:57,299 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 456 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:35:57,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 132 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:35:57,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-03-08 00:35:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 803. [2025-03-08 00:35:57,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 1.1895261845386533) internal successors, (954), 802 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 954 transitions. [2025-03-08 00:35:57,426 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 954 transitions. Word has length 312 [2025-03-08 00:35:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:35:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 954 transitions. [2025-03-08 00:35:57,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.837837837837838) internal successors, (68), 37 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:35:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 954 transitions. [2025-03-08 00:35:57,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2025-03-08 00:35:57,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:35:57,431 INFO L218 NwaCegarLoop]: trace histogram [352, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:35:57,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:35:57,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:57,635 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:35:57,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:35:57,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1082810067, now seen corresponding path program 8 times [2025-03-08 00:35:57,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:35:57,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772687008] [2025-03-08 00:35:57,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:35:57,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:35:57,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 504 statements into 2 equivalence classes. [2025-03-08 00:35:57,915 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 504 of 504 statements. [2025-03-08 00:35:57,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:35:57,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:35:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-03-08 00:35:59,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:35:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772687008] [2025-03-08 00:35:59,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772687008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:35:59,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149172511] [2025-03-08 00:35:59,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:35:59,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:35:59,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:35:59,876 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:35:59,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:36:00,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 504 statements into 2 equivalence classes. [2025-03-08 00:36:00,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 504 of 504 statements. [2025-03-08 00:36:00,614 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:36:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:00,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 3907 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-08 00:36:00,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:00,976 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-03-08 00:36:00,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:01,629 INFO L134 CoverageAnalysis]: Checked inductivity of 69694 backedges. 7958 proven. 253 refuted. 0 times theorem prover too weak. 61483 trivial. 0 not checked. [2025-03-08 00:36:01,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149172511] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:01,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:01,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 73 [2025-03-08 00:36:01,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210650272] [2025-03-08 00:36:01,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2025-03-08 00:36:01,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:01,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2025-03-08 00:36:01,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=2949, Unknown=0, NotChecked=0, Total=5256 [2025-03-08 00:36:01,633 INFO L87 Difference]: Start difference. First operand 803 states and 954 transitions. Second operand has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:03,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:03,078 INFO L93 Difference]: Finished difference Result 2699 states and 3891 transitions. [2025-03-08 00:36:03,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-08 00:36:03,078 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 504 [2025-03-08 00:36:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:03,084 INFO L225 Difference]: With dead ends: 2699 [2025-03-08 00:36:03,084 INFO L226 Difference]: Without dead ends: 1925 [2025-03-08 00:36:03,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1055 GetRequests, 961 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3217 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3480, Invalid=5640, Unknown=0, NotChecked=0, Total=9120 [2025-03-08 00:36:03,086 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1140 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:03,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 225 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:36:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2025-03-08 00:36:03,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1475. [2025-03-08 00:36:03,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 1474 states have (on average 1.1682496607869741) internal successors, (1722), 1474 states have internal predecessors, (1722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1722 transitions. [2025-03-08 00:36:03,312 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1722 transitions. Word has length 504 [2025-03-08 00:36:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:03,312 INFO L471 AbstractCegarLoop]: Abstraction has 1475 states and 1722 transitions. [2025-03-08 00:36:03,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1722 transitions. [2025-03-08 00:36:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2025-03-08 00:36:03,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:03,326 INFO L218 NwaCegarLoop]: trace histogram [736, 48, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:03,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:03,526 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,SelfDestructingSolverStorable17 [2025-03-08 00:36:03,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:03,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:03,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1057599187, now seen corresponding path program 9 times [2025-03-08 00:36:03,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:03,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667929854] [2025-03-08 00:36:03,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:03,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:03,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 888 statements into 389 equivalence classes. [2025-03-08 00:36:03,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 888 statements. [2025-03-08 00:36:03,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:36:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-03-08 00:36:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667929854] [2025-03-08 00:36:03,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667929854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:03,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801119211] [2025-03-08 00:36:03,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:36:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:03,773 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:03,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:36:04,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 888 statements into 389 equivalence classes. [2025-03-08 00:36:04,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 36 of 888 statements. [2025-03-08 00:36:04,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-08 00:36:04,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:04,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:36:04,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:05,064 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-03-08 00:36:05,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 284542 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 284518 trivial. 0 not checked. [2025-03-08 00:36:05,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801119211] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:05,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:05,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 00:36:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885592882] [2025-03-08 00:36:05,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:05,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 00:36:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:05,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 00:36:05,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-08 00:36:05,622 INFO L87 Difference]: Start difference. First operand 1475 states and 1722 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:05,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:05,926 INFO L93 Difference]: Finished difference Result 2194 states and 2683 transitions. [2025-03-08 00:36:05,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:36:05,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 888 [2025-03-08 00:36:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:05,932 INFO L225 Difference]: With dead ends: 2194 [2025-03-08 00:36:05,932 INFO L226 Difference]: Without dead ends: 1492 [2025-03-08 00:36:05,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1781 GetRequests, 1771 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:36:05,934 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 56 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:05,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 76 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:36:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2025-03-08 00:36:06,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1484. [2025-03-08 00:36:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1484 states, 1483 states have (on average 1.1625084288604182) internal successors, (1724), 1483 states have internal predecessors, (1724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1724 transitions. [2025-03-08 00:36:06,162 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1724 transitions. Word has length 888 [2025-03-08 00:36:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:06,163 INFO L471 AbstractCegarLoop]: Abstraction has 1484 states and 1724 transitions. [2025-03-08 00:36:06,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1724 transitions. [2025-03-08 00:36:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2025-03-08 00:36:06,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:06,168 INFO L218 NwaCegarLoop]: trace histogram [736, 48, 28, 16, 16, 12, 12, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:06,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:06,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:06,372 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:06,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:06,373 INFO L85 PathProgramCache]: Analyzing trace with hash 593242703, now seen corresponding path program 10 times [2025-03-08 00:36:06,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:06,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251028922] [2025-03-08 00:36:06,373 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:36:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:06,573 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 918 statements into 2 equivalence classes. [2025-03-08 00:36:06,610 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 918 statements. [2025-03-08 00:36:06,610 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:36:06,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:06,791 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 8 proven. 308 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-03-08 00:36:06,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:36:06,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251028922] [2025-03-08 00:36:06,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251028922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:36:06,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361167397] [2025-03-08 00:36:06,792 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:36:06,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:06,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:36:06,794 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:36:06,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:36:07,699 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 918 statements into 2 equivalence classes. [2025-03-08 00:36:07,783 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 180 of 918 statements. [2025-03-08 00:36:07,783 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-08 00:36:07,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:36:07,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-08 00:36:07,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:36:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 284 proven. 32 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-03-08 00:36:07,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:36:07,943 INFO L134 CoverageAnalysis]: Checked inductivity of 285136 backedges. 284 proven. 32 refuted. 0 times theorem prover too weak. 284820 trivial. 0 not checked. [2025-03-08 00:36:07,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361167397] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:36:07,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:36:07,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 21 [2025-03-08 00:36:07,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667484888] [2025-03-08 00:36:07,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:36:07,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 00:36:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:36:07,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 00:36:07,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2025-03-08 00:36:07,945 INFO L87 Difference]: Start difference. First operand 1484 states and 1724 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:08,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:36:08,583 INFO L93 Difference]: Finished difference Result 2236 states and 2700 transitions. [2025-03-08 00:36:08,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:36:08,583 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 918 [2025-03-08 00:36:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:36:08,589 INFO L225 Difference]: With dead ends: 2236 [2025-03-08 00:36:08,589 INFO L226 Difference]: Without dead ends: 1547 [2025-03-08 00:36:08,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1872 GetRequests, 1831 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=407, Invalid=1233, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 00:36:08,591 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 175 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:36:08,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 244 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:36:08,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2025-03-08 00:36:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1531. [2025-03-08 00:36:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1531 states, 1530 states have (on average 1.162091503267974) internal successors, (1778), 1530 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1531 states to 1531 states and 1778 transitions. [2025-03-08 00:36:08,873 INFO L78 Accepts]: Start accepts. Automaton has 1531 states and 1778 transitions. Word has length 918 [2025-03-08 00:36:08,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:36:08,873 INFO L471 AbstractCegarLoop]: Abstraction has 1531 states and 1778 transitions. [2025-03-08 00:36:08,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:36:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1531 states and 1778 transitions. [2025-03-08 00:36:08,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2025-03-08 00:36:08,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:36:08,878 INFO L218 NwaCegarLoop]: trace histogram [736, 64, 48, 16, 16, 16, 16, 12, 12, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:36:08,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-08 00:36:09,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:36:09,079 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:36:09,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:36:09,080 INFO L85 PathProgramCache]: Analyzing trace with hash 895735965, now seen corresponding path program 11 times [2025-03-08 00:36:09,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:36:09,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929240000] [2025-03-08 00:36:09,080 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:36:09,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:36:09,276 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 972 statements into 389 equivalence classes. [2025-03-08 00:36:29,870 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 194 check-sat command(s) and asserted 388 of 972 statements. [2025-03-08 00:36:29,870 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 194 check-sat command(s) [2025-03-08 00:36:29,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat