./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.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 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:32:49,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:32:49,847 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:32:49,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:32:49,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:32:49,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:32:49,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:32:49,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:32:49,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:32:49,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:32:49,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:32:49,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:32:49,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:32:49,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:32:49,881 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:32:49,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:32:49,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:32:49,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:32:49,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:49,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:32:49,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:32:49,884 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 -> 5a6204b8fe11d129da43c7784d578168196f39a9dd912e242b1920607a0dfe2c [2025-03-16 19:32:50,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:32:50,124 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:32:50,127 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:32:50,128 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:32:50,128 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:32:50,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:32:51,317 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb33ddf1/4721133fda62434e902e64f551a4b67b/FLAG4dfe6374a [2025-03-16 19:32:51,566 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:32:51,566 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:32:51,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb33ddf1/4721133fda62434e902e64f551a4b67b/FLAG4dfe6374a [2025-03-16 19:32:51,880 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeb33ddf1/4721133fda62434e902e64f551a4b67b [2025-03-16 19:32:51,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:32:51,885 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:32:51,886 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:51,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:32:51,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:32:51,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:51" (1/1) ... [2025-03-16 19:32:51,889 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53a7f6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:51, skipping insertion in model container [2025-03-16 19:32:51,889 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:32:51" (1/1) ... [2025-03-16 19:32:51,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:32:52,027 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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2025-03-16 19:32:52,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:52,050 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:32:52,082 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/seq-mthreaded-reduced/pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[4938,4951] [2025-03-16 19:32:52,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:32:52,110 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:32:52,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52 WrapperNode [2025-03-16 19:32:52,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:32:52,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:52,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:32:52,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:32:52,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,150 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 369 [2025-03-16 19:32:52,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:32:52,150 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:32:52,150 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:32:52,150 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:32:52,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,159 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:32:52,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,174 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,175 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,177 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:32:52,178 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:32:52,179 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:32:52,179 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:32:52,179 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (1/1) ... [2025-03-16 19:32:52,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:32:52,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:52,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:32:52,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:32:52,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:32:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:32:52,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:32:52,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:32:52,309 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:32:52,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L448: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L151: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L308: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L201: havoc main_~node4__m4~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L186: havoc main_~node3__m3~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L171: havoc main_~node2__m2~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L353: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L239: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:32:52,619 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L398: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:32:52,633 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-16 19:32:52,633 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:32:52,641 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:32:52,642 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:32:52,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:52 BoogieIcfgContainer [2025-03-16 19:32:52,643 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:32:52,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:32:52,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:32:52,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:32:52,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:32:51" (1/3) ... [2025-03-16 19:32:52,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25796dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:52, skipping insertion in model container [2025-03-16 19:32:52,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:32:52" (2/3) ... [2025-03-16 19:32:52,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25796dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:32:52, skipping insertion in model container [2025-03-16 19:32:52,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:32:52" (3/3) ... [2025-03-16 19:32:52,651 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2025-03-16 19:32:52,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:32:52,664 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c that has 1 procedures, 80 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:32:52,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:32:52,712 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;@4a67b6a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:32:52,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:32:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 79 states have internal predecessors, (134), 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-16 19:32:52,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-16 19:32:52,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:52,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:52,722 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:52,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:52,725 INFO L85 PathProgramCache]: Analyzing trace with hash 788005942, now seen corresponding path program 1 times [2025-03-16 19:32:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:52,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784773926] [2025-03-16 19:32:52,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:52,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:52,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-16 19:32:52,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-16 19:32:52,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:52,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:53,071 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-16 19:32:53,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:53,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784773926] [2025-03-16 19:32:53,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784773926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:53,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547332795] [2025-03-16 19:32:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:53,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:53,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:53,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,095 INFO L87 Difference]: Start difference. First operand has 80 states, 78 states have (on average 1.7179487179487178) internal successors, (134), 79 states have internal predecessors, (134), 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 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-16 19:32:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:53,136 INFO L93 Difference]: Finished difference Result 182 states and 291 transitions. [2025-03-16 19:32:53,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:53,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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 47 [2025-03-16 19:32:53,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:53,149 INFO L225 Difference]: With dead ends: 182 [2025-03-16 19:32:53,149 INFO L226 Difference]: Without dead ends: 121 [2025-03-16 19:32:53,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,152 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:53,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 272 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-16 19:32:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-16 19:32:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 118 states have internal predecessors, (174), 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-16 19:32:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2025-03-16 19:32:53,180 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 47 [2025-03-16 19:32:53,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:53,181 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2025-03-16 19:32:53,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-16 19:32:53,181 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2025-03-16 19:32:53,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 19:32:53,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:53,183 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:53,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:32:53,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:53,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:53,184 INFO L85 PathProgramCache]: Analyzing trace with hash -630835920, now seen corresponding path program 1 times [2025-03-16 19:32:53,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:53,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600426690] [2025-03-16 19:32:53,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:53,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 19:32:53,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 19:32:53,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:53,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:53,302 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-16 19:32:53,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:53,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600426690] [2025-03-16 19:32:53,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600426690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:53,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:53,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:53,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381185943] [2025-03-16 19:32:53,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:53,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:53,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:53,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,304 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-16 19:32:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:53,331 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2025-03-16 19:32:53,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:53,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2025-03-16 19:32:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:53,333 INFO L225 Difference]: With dead ends: 291 [2025-03-16 19:32:53,335 INFO L226 Difference]: Without dead ends: 197 [2025-03-16 19:32:53,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,336 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 62 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:53,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-16 19:32:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2025-03-16 19:32:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.5154639175257731) internal successors, (294), 194 states have internal predecessors, (294), 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-16 19:32:53,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 294 transitions. [2025-03-16 19:32:53,353 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 294 transitions. Word has length 48 [2025-03-16 19:32:53,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:53,353 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 294 transitions. [2025-03-16 19:32:53,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-16 19:32:53,353 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 294 transitions. [2025-03-16 19:32:53,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 19:32:53,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:53,354 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:53,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:32:53,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:53,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1198776669, now seen corresponding path program 1 times [2025-03-16 19:32:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950088625] [2025-03-16 19:32:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:53,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 19:32:53,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 19:32:53,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:53,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:53,450 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-16 19:32:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:53,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950088625] [2025-03-16 19:32:53,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950088625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:53,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:53,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:53,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595151187] [2025-03-16 19:32:53,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:53,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:53,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:53,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,452 INFO L87 Difference]: Start difference. First operand 195 states and 294 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-16 19:32:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:53,476 INFO L93 Difference]: Finished difference Result 503 states and 780 transitions. [2025-03-16 19:32:53,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:53,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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 49 [2025-03-16 19:32:53,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:53,478 INFO L225 Difference]: With dead ends: 503 [2025-03-16 19:32:53,478 INFO L226 Difference]: Without dead ends: 333 [2025-03-16 19:32:53,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,479 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 57 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:53,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 226 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:53,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-03-16 19:32:53,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2025-03-16 19:32:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 330 states have (on average 1.5333333333333334) internal successors, (506), 330 states have internal predecessors, (506), 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-16 19:32:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 506 transitions. [2025-03-16 19:32:53,490 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 506 transitions. Word has length 49 [2025-03-16 19:32:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:53,491 INFO L471 AbstractCegarLoop]: Abstraction has 331 states and 506 transitions. [2025-03-16 19:32:53,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 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-16 19:32:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 506 transitions. [2025-03-16 19:32:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 19:32:53,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:53,492 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, 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-16 19:32:53,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:32:53,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:53,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:53,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1017119427, now seen corresponding path program 1 times [2025-03-16 19:32:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:53,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82675003] [2025-03-16 19:32:53,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:53,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:53,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 19:32:53,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 19:32:53,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:53,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:53,666 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-16 19:32:53,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:53,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82675003] [2025-03-16 19:32:53,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82675003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:53,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:53,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:53,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073751715] [2025-03-16 19:32:53,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:53,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:53,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:53,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:53,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:53,668 INFO L87 Difference]: Start difference. First operand 331 states and 506 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-16 19:32:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:53,835 INFO L93 Difference]: Finished difference Result 2779 states and 4354 transitions. [2025-03-16 19:32:53,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:32:53,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-16 19:32:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:53,850 INFO L225 Difference]: With dead ends: 2779 [2025-03-16 19:32:53,850 INFO L226 Difference]: Without dead ends: 2473 [2025-03-16 19:32:53,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-16 19:32:53,852 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 703 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:53,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1198 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2025-03-16 19:32:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 635. [2025-03-16 19:32:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.5299684542586751) internal successors, (970), 634 states have internal predecessors, (970), 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-16 19:32:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 970 transitions. [2025-03-16 19:32:53,894 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 970 transitions. Word has length 50 [2025-03-16 19:32:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:53,894 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 970 transitions. [2025-03-16 19:32:53,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-16 19:32:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 970 transitions. [2025-03-16 19:32:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:32:53,895 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:53,895 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, 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-16 19:32:53,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:32:53,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1839655622, now seen corresponding path program 1 times [2025-03-16 19:32:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:53,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886301820] [2025-03-16 19:32:53,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:53,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:32:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:32:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:53,975 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-16 19:32:53,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:53,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886301820] [2025-03-16 19:32:53,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886301820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:53,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:53,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:53,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816794345] [2025-03-16 19:32:53,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:53,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:53,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:53,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:53,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:53,977 INFO L87 Difference]: Start difference. First operand 635 states and 970 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:54,001 INFO L93 Difference]: Finished difference Result 1767 states and 2708 transitions. [2025-03-16 19:32:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:32:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:54,005 INFO L225 Difference]: With dead ends: 1767 [2025-03-16 19:32:54,005 INFO L226 Difference]: Without dead ends: 1157 [2025-03-16 19:32:54,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:54,006 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:54,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 179 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2025-03-16 19:32:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1139. [2025-03-16 19:32:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4991212653778558) internal successors, (1706), 1138 states have internal predecessors, (1706), 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-16 19:32:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1706 transitions. [2025-03-16 19:32:54,048 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1706 transitions. Word has length 52 [2025-03-16 19:32:54,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:54,049 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1706 transitions. [2025-03-16 19:32:54,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1706 transitions. [2025-03-16 19:32:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 19:32:54,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,052 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, 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-16 19:32:54,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:32:54,052 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1840817471, now seen corresponding path program 1 times [2025-03-16 19:32:54,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508802446] [2025-03-16 19:32:54,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 19:32:54,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 19:32:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:54,262 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-16 19:32:54,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:54,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508802446] [2025-03-16 19:32:54,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508802446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:54,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:54,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:54,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203703055] [2025-03-16 19:32:54,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:54,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:54,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:54,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:54,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:54,264 INFO L87 Difference]: Start difference. First operand 1139 states and 1706 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:54,375 INFO L93 Difference]: Finished difference Result 2255 states and 3388 transitions. [2025-03-16 19:32:54,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:54,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2025-03-16 19:32:54,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:54,379 INFO L225 Difference]: With dead ends: 2255 [2025-03-16 19:32:54,379 INFO L226 Difference]: Without dead ends: 1141 [2025-03-16 19:32:54,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:32:54,383 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 220 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:54,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 336 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2025-03-16 19:32:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1139. [2025-03-16 19:32:54,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1138 states have (on average 1.4850615114235501) internal successors, (1690), 1138 states have internal predecessors, (1690), 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-16 19:32:54,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1690 transitions. [2025-03-16 19:32:54,407 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1690 transitions. Word has length 52 [2025-03-16 19:32:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:54,407 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1690 transitions. [2025-03-16 19:32:54,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1690 transitions. [2025-03-16 19:32:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:32:54,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,409 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, 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-16 19:32:54,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:32:54,410 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1231722059, now seen corresponding path program 1 times [2025-03-16 19:32:54,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502118660] [2025-03-16 19:32:54,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:32:54,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:32:54,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:54,647 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-16 19:32:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502118660] [2025-03-16 19:32:54,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502118660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:54,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:32:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610185617] [2025-03-16 19:32:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:32:54,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:32:54,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:54,648 INFO L87 Difference]: Start difference. First operand 1139 states and 1690 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:54,671 INFO L93 Difference]: Finished difference Result 1173 states and 1739 transitions. [2025-03-16 19:32:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:32:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:32:54,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:54,675 INFO L225 Difference]: With dead ends: 1173 [2025-03-16 19:32:54,675 INFO L226 Difference]: Without dead ends: 1171 [2025-03-16 19:32:54,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:32:54,676 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:54,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:54,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2025-03-16 19:32:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2025-03-16 19:32:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1171 states, 1170 states have (on average 1.4649572649572649) internal successors, (1714), 1170 states have internal predecessors, (1714), 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-16 19:32:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1714 transitions. [2025-03-16 19:32:54,695 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1714 transitions. Word has length 53 [2025-03-16 19:32:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:54,696 INFO L471 AbstractCegarLoop]: Abstraction has 1171 states and 1714 transitions. [2025-03-16 19:32:54,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1714 transitions. [2025-03-16 19:32:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 19:32:54,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,697 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, 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-16 19:32:54,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:32:54,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1096858400, now seen corresponding path program 1 times [2025-03-16 19:32:54,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375514250] [2025-03-16 19:32:54,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 19:32:54,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 19:32:54,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:54,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:54,743 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-16 19:32:54,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:54,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375514250] [2025-03-16 19:32:54,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375514250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:54,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:54,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669311974] [2025-03-16 19:32:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:54,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:54,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:54,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:54,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:54,745 INFO L87 Difference]: Start difference. First operand 1171 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:54,761 INFO L93 Difference]: Finished difference Result 2298 states and 3400 transitions. [2025-03-16 19:32:54,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:54,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-16 19:32:54,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:54,766 INFO L225 Difference]: With dead ends: 2298 [2025-03-16 19:32:54,766 INFO L226 Difference]: Without dead ends: 1655 [2025-03-16 19:32:54,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:54,767 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 69 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:54,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 242 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:54,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2025-03-16 19:32:54,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1653. [2025-03-16 19:32:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1652 states have (on average 1.460048426150121) internal successors, (2412), 1652 states have internal predecessors, (2412), 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-16 19:32:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2412 transitions. [2025-03-16 19:32:54,793 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2412 transitions. Word has length 53 [2025-03-16 19:32:54,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:54,794 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2412 transitions. [2025-03-16 19:32:54,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:32:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2412 transitions. [2025-03-16 19:32:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:32:54,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:54,796 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:54,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:32:54,796 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:54,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1695492558, now seen corresponding path program 1 times [2025-03-16 19:32:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881124032] [2025-03-16 19:32:54,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:54,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:32:54,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:32:54,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:54,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 19:32:54,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:54,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881124032] [2025-03-16 19:32:54,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881124032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:54,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223195097] [2025-03-16 19:32:54,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:54,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:54,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:54,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:54,921 INFO L87 Difference]: Start difference. First operand 1653 states and 2412 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-16 19:32:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,035 INFO L93 Difference]: Finished difference Result 8471 states and 12393 transitions. [2025-03-16 19:32:55,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 76 [2025-03-16 19:32:55,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,055 INFO L225 Difference]: With dead ends: 8471 [2025-03-16 19:32:55,055 INFO L226 Difference]: Without dead ends: 6845 [2025-03-16 19:32:55,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,062 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 515 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 604 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:55,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6845 states. [2025-03-16 19:32:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6845 to 3277. [2025-03-16 19:32:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3277 states, 3276 states have (on average 1.4566544566544566) internal successors, (4772), 3276 states have internal predecessors, (4772), 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-16 19:32:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3277 states to 3277 states and 4772 transitions. [2025-03-16 19:32:55,146 INFO L78 Accepts]: Start accepts. Automaton has 3277 states and 4772 transitions. Word has length 76 [2025-03-16 19:32:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,146 INFO L471 AbstractCegarLoop]: Abstraction has 3277 states and 4772 transitions. [2025-03-16 19:32:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-16 19:32:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 3277 states and 4772 transitions. [2025-03-16 19:32:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:32:55,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,148 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:55,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:32:55,148 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -239910642, now seen corresponding path program 1 times [2025-03-16 19:32:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101383052] [2025-03-16 19:32:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:32:55,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:32:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 19:32:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101383052] [2025-03-16 19:32:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101383052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744816752] [2025-03-16 19:32:55,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:55,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:55,264 INFO L87 Difference]: Start difference. First operand 3277 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-16 19:32:55,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,360 INFO L93 Difference]: Finished difference Result 10095 states and 14753 transitions. [2025-03-16 19:32:55,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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 76 [2025-03-16 19:32:55,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,383 INFO L225 Difference]: With dead ends: 10095 [2025-03-16 19:32:55,384 INFO L226 Difference]: Without dead ends: 8469 [2025-03-16 19:32:55,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,389 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 500 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 586 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2025-03-16 19:32:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 5717. [2025-03-16 19:32:55,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5717 states, 5716 states have (on average 1.4506648005598322) internal successors, (8292), 5716 states have internal predecessors, (8292), 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-16 19:32:55,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5717 states to 5717 states and 8292 transitions. [2025-03-16 19:32:55,495 INFO L78 Accepts]: Start accepts. Automaton has 5717 states and 8292 transitions. Word has length 76 [2025-03-16 19:32:55,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,495 INFO L471 AbstractCegarLoop]: Abstraction has 5717 states and 8292 transitions. [2025-03-16 19:32:55,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 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-16 19:32:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 5717 states and 8292 transitions. [2025-03-16 19:32:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:32:55,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:55,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:32:55,498 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash -447754898, now seen corresponding path program 1 times [2025-03-16 19:32:55,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003461097] [2025-03-16 19:32:55,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:32:55,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:32:55,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:55,623 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-16 19:32:55,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:55,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003461097] [2025-03-16 19:32:55,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003461097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:55,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:55,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:55,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802577455] [2025-03-16 19:32:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:55,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:55,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:55,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:55,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:55,625 INFO L87 Difference]: Start difference. First operand 5717 states and 8292 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-16 19:32:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:55,729 INFO L93 Difference]: Finished difference Result 11719 states and 17113 transitions. [2025-03-16 19:32:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:55,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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 76 [2025-03-16 19:32:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:55,748 INFO L225 Difference]: With dead ends: 11719 [2025-03-16 19:32:55,748 INFO L226 Difference]: Without dead ends: 10093 [2025-03-16 19:32:55,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:55,754 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 461 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:55,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 650 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:55,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10093 states. [2025-03-16 19:32:55,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10093 to 7341. [2025-03-16 19:32:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7341 states, 7340 states have (on average 1.4512261580381471) internal successors, (10652), 7340 states have internal predecessors, (10652), 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-16 19:32:55,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 10652 transitions. [2025-03-16 19:32:55,896 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 10652 transitions. Word has length 76 [2025-03-16 19:32:55,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:55,896 INFO L471 AbstractCegarLoop]: Abstraction has 7341 states and 10652 transitions. [2025-03-16 19:32:55,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 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-16 19:32:55,896 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 10652 transitions. [2025-03-16 19:32:55,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:32:55,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:55,897 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:55,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:32:55,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:55,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash 515230807, now seen corresponding path program 1 times [2025-03-16 19:32:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492211399] [2025-03-16 19:32:55,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:55,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:55,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:32:55,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:32:55,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:55,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:32:56,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492211399] [2025-03-16 19:32:56,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492211399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:32:56,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022374827] [2025-03-16 19:32:56,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:32:56,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:32:56,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:32:56,010 INFO L87 Difference]: Start difference. First operand 7341 states and 10652 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-16 19:32:56,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,113 INFO L93 Difference]: Finished difference Result 12335 states and 18033 transitions. [2025-03-16 19:32:56,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:32:56,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-16 19:32:56,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,131 INFO L225 Difference]: With dead ends: 12335 [2025-03-16 19:32:56,131 INFO L226 Difference]: Without dead ends: 11213 [2025-03-16 19:32:56,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:32:56,136 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 508 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 662 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:32:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11213 states. [2025-03-16 19:32:56,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11213 to 8461. [2025-03-16 19:32:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8461 states, 8460 states have (on average 1.4539007092198581) internal successors, (12300), 8460 states have internal predecessors, (12300), 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-16 19:32:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8461 states to 8461 states and 12300 transitions. [2025-03-16 19:32:56,290 INFO L78 Accepts]: Start accepts. Automaton has 8461 states and 12300 transitions. Word has length 77 [2025-03-16 19:32:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,290 INFO L471 AbstractCegarLoop]: Abstraction has 8461 states and 12300 transitions. [2025-03-16 19:32:56,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 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-16 19:32:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8461 states and 12300 transitions. [2025-03-16 19:32:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:32:56,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,292 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:32:56,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,293 INFO L85 PathProgramCache]: Analyzing trace with hash 340902410, now seen corresponding path program 1 times [2025-03-16 19:32:56,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843003062] [2025-03-16 19:32:56,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:32:56,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:32:56,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:56,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843003062] [2025-03-16 19:32:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843003062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:32:56,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:32:56,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:32:56,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370711073] [2025-03-16 19:32:56,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:32:56,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:32:56,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:56,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:32:56,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:56,373 INFO L87 Difference]: Start difference. First operand 8461 states and 12300 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 19:32:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:32:56,408 INFO L93 Difference]: Finished difference Result 14657 states and 21407 transitions. [2025-03-16 19:32:56,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:32:56,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-16 19:32:56,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:32:56,419 INFO L225 Difference]: With dead ends: 14657 [2025-03-16 19:32:56,419 INFO L226 Difference]: Without dead ends: 6223 [2025-03-16 19:32:56,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:32:56,428 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 51 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:32:56,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 231 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:32:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6223 states. [2025-03-16 19:32:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6223 to 6221. [2025-03-16 19:32:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6221 states, 6220 states have (on average 1.4540192926045017) internal successors, (9044), 6220 states have internal predecessors, (9044), 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-16 19:32:56,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6221 states to 6221 states and 9044 transitions. [2025-03-16 19:32:56,520 INFO L78 Accepts]: Start accepts. Automaton has 6221 states and 9044 transitions. Word has length 78 [2025-03-16 19:32:56,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:32:56,520 INFO L471 AbstractCegarLoop]: Abstraction has 6221 states and 9044 transitions. [2025-03-16 19:32:56,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 19:32:56,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6221 states and 9044 transitions. [2025-03-16 19:32:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-16 19:32:56,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:32:56,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:32:56,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:32:56,522 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:32:56,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:32:56,522 INFO L85 PathProgramCache]: Analyzing trace with hash -798810266, now seen corresponding path program 1 times [2025-03-16 19:32:56,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:32:56,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258214538] [2025-03-16 19:32:56,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:32:56,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:32:56,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:32:56,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:56,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:32:56,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:32:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258214538] [2025-03-16 19:32:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258214538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:32:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898024598] [2025-03-16 19:32:56,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:32:56,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:32:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:32:56,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:32:56,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 19:32:56,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-16 19:32:57,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-16 19:32:57,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:32:57,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:32:57,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 19:32:57,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:32:57,235 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:32:57,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:32:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:32:57,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898024598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:32:57,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:32:57,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 19:32:57,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301075369] [2025-03-16 19:32:57,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:32:57,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 19:32:57,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:32:57,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 19:32:57,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-16 19:32:57,421 INFO L87 Difference]: Start difference. First operand 6221 states and 9044 transitions. Second operand has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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-16 19:33:00,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:00,474 INFO L93 Difference]: Finished difference Result 68910 states and 98873 transitions. [2025-03-16 19:33:00,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2025-03-16 19:33:00,475 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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 78 [2025-03-16 19:33:00,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:00,607 INFO L225 Difference]: With dead ends: 68910 [2025-03-16 19:33:00,607 INFO L226 Difference]: Without dead ends: 62724 [2025-03-16 19:33:00,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4554 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1955, Invalid=9601, Unknown=0, NotChecked=0, Total=11556 [2025-03-16 19:33:00,624 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 4056 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:00,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4056 Valid, 1001 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 19:33:00,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62724 states. [2025-03-16 19:33:01,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62724 to 46579. [2025-03-16 19:33:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46579 states, 46578 states have (on average 1.3907209412168835) internal successors, (64777), 46578 states have internal predecessors, (64777), 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-16 19:33:01,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46579 states to 46579 states and 64777 transitions. [2025-03-16 19:33:01,389 INFO L78 Accepts]: Start accepts. Automaton has 46579 states and 64777 transitions. Word has length 78 [2025-03-16 19:33:01,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:01,389 INFO L471 AbstractCegarLoop]: Abstraction has 46579 states and 64777 transitions. [2025-03-16 19:33:01,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.277777777777779) internal successors, (221), 18 states have internal predecessors, (221), 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-16 19:33:01,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46579 states and 64777 transitions. [2025-03-16 19:33:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:33:01,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:01,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:01,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 19:33:01,592 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,SelfDestructingSolverStorable13 [2025-03-16 19:33:01,592 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:01,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:01,596 INFO L85 PathProgramCache]: Analyzing trace with hash -227118413, now seen corresponding path program 1 times [2025-03-16 19:33:01,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810882281] [2025-03-16 19:33:01,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:01,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:33:01,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:33:01,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:01,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:01,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:01,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:01,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810882281] [2025-03-16 19:33:01,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810882281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:01,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346089243] [2025-03-16 19:33:01,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:01,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:01,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:01,806 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:33:01,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 19:33:01,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:33:01,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:33:01,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:01,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:01,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-16 19:33:01,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:02,378 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:02,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:02,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346089243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:02,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:02,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2025-03-16 19:33:02,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637996006] [2025-03-16 19:33:02,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:02,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-16 19:33:02,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:02,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-16 19:33:02,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2025-03-16 19:33:02,935 INFO L87 Difference]: Start difference. First operand 46579 states and 64777 transitions. Second operand has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 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-16 19:33:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:06,715 INFO L93 Difference]: Finished difference Result 447160 states and 623882 transitions. [2025-03-16 19:33:06,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2025-03-16 19:33:06,716 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 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 79 [2025-03-16 19:33:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:07,587 INFO L225 Difference]: With dead ends: 447160 [2025-03-16 19:33:07,587 INFO L226 Difference]: Without dead ends: 400610 [2025-03-16 19:33:07,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5506 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2443, Invalid=13813, Unknown=0, NotChecked=0, Total=16256 [2025-03-16 19:33:07,664 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 5165 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5165 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:07,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5165 Valid, 1087 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 19:33:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400610 states. [2025-03-16 19:33:11,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400610 to 255169. [2025-03-16 19:33:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255169 states, 255168 states have (on average 1.3622946450965638) internal successors, (347614), 255168 states have internal predecessors, (347614), 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-16 19:33:12,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255169 states to 255169 states and 347614 transitions. [2025-03-16 19:33:12,221 INFO L78 Accepts]: Start accepts. Automaton has 255169 states and 347614 transitions. Word has length 79 [2025-03-16 19:33:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:12,222 INFO L471 AbstractCegarLoop]: Abstraction has 255169 states and 347614 transitions. [2025-03-16 19:33:12,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.782608695652174) internal successors, (225), 22 states have internal predecessors, (225), 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-16 19:33:12,222 INFO L276 IsEmpty]: Start isEmpty. Operand 255169 states and 347614 transitions. [2025-03-16 19:33:12,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:33:12,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:12,225 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:12,233 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-16 19:33:12,426 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,SelfDestructingSolverStorable14 [2025-03-16 19:33:12,426 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash -193481949, now seen corresponding path program 1 times [2025-03-16 19:33:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:12,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108573342] [2025-03-16 19:33:12,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:12,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:33:12,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:33:12,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:12,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:12,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:12,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108573342] [2025-03-16 19:33:12,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108573342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:12,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:12,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:12,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689583814] [2025-03-16 19:33:12,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:12,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:12,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:12,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:12,486 INFO L87 Difference]: Start difference. First operand 255169 states and 347614 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-16 19:33:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:13,369 INFO L93 Difference]: Finished difference Result 381989 states and 520153 transitions. [2025-03-16 19:33:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:13,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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 80 [2025-03-16 19:33:13,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:13,747 INFO L225 Difference]: With dead ends: 381989 [2025-03-16 19:33:13,747 INFO L226 Difference]: Without dead ends: 143886 [2025-03-16 19:33:13,880 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:13,885 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 43 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:13,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 216 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:13,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143886 states. [2025-03-16 19:33:15,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143886 to 143884. [2025-03-16 19:33:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143884 states, 143883 states have (on average 1.3385598020613971) internal successors, (192596), 143883 states have internal predecessors, (192596), 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-16 19:33:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143884 states to 143884 states and 192596 transitions. [2025-03-16 19:33:15,873 INFO L78 Accepts]: Start accepts. Automaton has 143884 states and 192596 transitions. Word has length 80 [2025-03-16 19:33:15,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:15,874 INFO L471 AbstractCegarLoop]: Abstraction has 143884 states and 192596 transitions. [2025-03-16 19:33:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 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-16 19:33:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 143884 states and 192596 transitions. [2025-03-16 19:33:15,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:33:15,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:15,883 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:15,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:33:15,883 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -656954248, now seen corresponding path program 1 times [2025-03-16 19:33:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135090475] [2025-03-16 19:33:15,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:15,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:15,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:33:15,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:33:15,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:15,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:16,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135090475] [2025-03-16 19:33:16,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135090475] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:33:16,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120090081] [2025-03-16 19:33:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:16,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:33:16,078 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 19:33:16,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 19:33:16,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:33:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:33:16,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:16,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:16,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 19:33:16,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:33:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:17,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:33:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:18,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120090081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:33:18,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:33:18,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 16] total 35 [2025-03-16 19:33:18,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292447588] [2025-03-16 19:33:18,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:33:18,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 19:33:18,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:18,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 19:33:18,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 19:33:18,238 INFO L87 Difference]: Start difference. First operand 143884 states and 192596 transitions. Second operand has 36 states, 36 states have (on average 5.861111111111111) internal successors, (211), 35 states have internal predecessors, (211), 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-16 19:33:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:27,000 INFO L93 Difference]: Finished difference Result 817535 states and 1081708 transitions. [2025-03-16 19:33:27,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2025-03-16 19:33:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 5.861111111111111) internal successors, (211), 35 states have internal predecessors, (211), 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 80 [2025-03-16 19:33:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:27,919 INFO L225 Difference]: With dead ends: 817535 [2025-03-16 19:33:27,919 INFO L226 Difference]: Without dead ends: 673757 [2025-03-16 19:33:28,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17789 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8313, Invalid=35577, Unknown=0, NotChecked=0, Total=43890 [2025-03-16 19:33:28,083 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 5331 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5331 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:28,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5331 Valid, 1720 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 19:33:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673757 states. [2025-03-16 19:33:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673757 to 439535. [2025-03-16 19:33:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439535 states, 439534 states have (on average 1.3227873156570367) internal successors, (581410), 439534 states have internal predecessors, (581410), 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-16 19:33:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439535 states to 439535 states and 581410 transitions. [2025-03-16 19:33:34,815 INFO L78 Accepts]: Start accepts. Automaton has 439535 states and 581410 transitions. Word has length 80 [2025-03-16 19:33:34,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:34,815 INFO L471 AbstractCegarLoop]: Abstraction has 439535 states and 581410 transitions. [2025-03-16 19:33:34,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 5.861111111111111) internal successors, (211), 35 states have internal predecessors, (211), 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-16 19:33:34,815 INFO L276 IsEmpty]: Start isEmpty. Operand 439535 states and 581410 transitions. [2025-03-16 19:33:34,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:33:34,817 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:34,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:34,824 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-16 19:33:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:33:35,018 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:35,022 INFO L85 PathProgramCache]: Analyzing trace with hash -981335292, now seen corresponding path program 1 times [2025-03-16 19:33:35,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:35,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561205246] [2025-03-16 19:33:35,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:35,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:35,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:33:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:33:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 19:33:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561205246] [2025-03-16 19:33:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561205246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:35,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679421723] [2025-03-16 19:33:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:35,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:35,056 INFO L87 Difference]: Start difference. First operand 439535 states and 581410 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 19:33:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:33:37,000 INFO L93 Difference]: Finished difference Result 855950 states and 1135335 transitions. [2025-03-16 19:33:37,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:33:37,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 81 [2025-03-16 19:33:37,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:33:38,126 INFO L225 Difference]: With dead ends: 855950 [2025-03-16 19:33:38,127 INFO L226 Difference]: Without dead ends: 416625 [2025-03-16 19:33:38,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:38,184 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 61 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:33:38,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 97 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:33:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416625 states. [2025-03-16 19:33:42,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416625 to 416625. [2025-03-16 19:33:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416625 states, 416624 states have (on average 1.31449700449326) internal successors, (547651), 416624 states have internal predecessors, (547651), 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-16 19:33:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416625 states to 416625 states and 547651 transitions. [2025-03-16 19:33:43,553 INFO L78 Accepts]: Start accepts. Automaton has 416625 states and 547651 transitions. Word has length 81 [2025-03-16 19:33:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:33:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 416625 states and 547651 transitions. [2025-03-16 19:33:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 19:33:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 416625 states and 547651 transitions. [2025-03-16 19:33:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-16 19:33:43,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:33:43,556 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:33:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 19:33:43,556 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:33:43,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:33:43,556 INFO L85 PathProgramCache]: Analyzing trace with hash -2112713334, now seen corresponding path program 1 times [2025-03-16 19:33:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:33:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356796010] [2025-03-16 19:33:43,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:33:43,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:33:43,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-16 19:33:43,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-16 19:33:43,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:33:43,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:33:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:33:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:33:43,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356796010] [2025-03-16 19:33:43,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356796010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:33:43,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:33:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:33:43,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978614760] [2025-03-16 19:33:43,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:33:43,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:33:43,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:33:43,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:33:43,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:33:43,611 INFO L87 Difference]: Start difference. First operand 416625 states and 547651 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 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)