./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.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.6.1.ufo.BOUNDED-12.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 b86eed5380d57cac13df908fa4bd28a3c3af485a2a70f27e08920aaaec0ccb21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:34:33,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:34:33,724 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:34:33,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:34:33,728 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:34:33,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:34:33,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:34:33,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:34:33,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:34:33,746 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:34:33,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:34:33,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:34:33,747 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:34:33,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:34:33,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:34:33,748 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:34:33,748 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:33,749 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:34:33,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:34:33,749 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 -> b86eed5380d57cac13df908fa4bd28a3c3af485a2a70f27e08920aaaec0ccb21 [2025-03-16 19:34:33,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:34:33,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:34:33,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:34:33,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:34:33,974 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:34:33,975 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:34:35,124 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb52fd48/33d9980df616487da26badbbefecfc81/FLAGe7d6789fa [2025-03-16 19:34:35,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:34:35,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:34:35,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb52fd48/33d9980df616487da26badbbefecfc81/FLAGe7d6789fa [2025-03-16 19:34:35,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/deb52fd48/33d9980df616487da26badbbefecfc81 [2025-03-16 19:34:35,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:34:35,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:34:35,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:35,405 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:34:35,408 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:34:35,409 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ac4823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35, skipping insertion in model container [2025-03-16 19:34:35,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:34:35,616 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.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6696,6709] [2025-03-16 19:34:35,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:35,657 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:34:35,699 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.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c[6696,6709] [2025-03-16 19:34:35,716 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:34:35,729 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:34:35,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35 WrapperNode [2025-03-16 19:34:35,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:34:35,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:35,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:34:35,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:34:35,735 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:34:35" (1/1) ... [2025-03-16 19:34:35,741 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:34:35" (1/1) ... [2025-03-16 19:34:35,760 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 542 [2025-03-16 19:34:35,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:34:35,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:34:35,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:34:35,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:34:35,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,772 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,788 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:34:35,788 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,797 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,800 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:34:35,802 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:34:35,802 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:34:35,802 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:34:35,803 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (1/1) ... [2025-03-16 19:34:35,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:34:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:35,830 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:34:35,832 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:34:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:34:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:34:35,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:34:35,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:34:35,935 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:34:35,937 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L630: havoc main_~node1____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L449: havoc main_~node5____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L584: havoc main_~node2____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: havoc main_~node6____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L291: havoc main_~node6__m6~0#1; [2025-03-16 19:34:36,386 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L539: havoc main_~node3____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L276: havoc main_~node5__m5~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node4__m4~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L344: havoc main_~main____CPAchecker_TMP_0~0#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node3__m3~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L494: havoc main_~node4____CPAchecker_TMP_0~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L231: havoc main_~node2__m2~0#1; [2025-03-16 19:34:36,387 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L215: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2025-03-16 19:34:36,418 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-03-16 19:34:36,418 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:34:36,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:34:36,427 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:34:36,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:36 BoogieIcfgContainer [2025-03-16 19:34:36,428 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:34:36,430 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:34:36,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:34:36,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:34:36,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:34:35" (1/3) ... [2025-03-16 19:34:36,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306f16fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:36, skipping insertion in model container [2025-03-16 19:34:36,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:34:35" (2/3) ... [2025-03-16 19:34:36,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@306f16fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:34:36, skipping insertion in model container [2025-03-16 19:34:36,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:34:36" (3/3) ... [2025-03-16 19:34:36,436 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2025-03-16 19:34:36,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:34:36,448 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c that has 1 procedures, 115 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 19:34:36,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:34:36,497 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;@30a244c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:34:36,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 19:34:36,500 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 113 states have (on average 1.752212389380531) internal successors, (198), 114 states have internal predecessors, (198), 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:34:36,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2025-03-16 19:34:36,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:36,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,511 INFO L85 PathProgramCache]: Analyzing trace with hash -330163604, now seen corresponding path program 1 times [2025-03-16 19:34:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259337010] [2025-03-16 19:34:36,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:36,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-16 19:34:36,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-16 19:34:36,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:36,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:36,878 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:34:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259337010] [2025-03-16 19:34:36,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259337010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:36,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:36,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255830526] [2025-03-16 19:34:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:36,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:36,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:36,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:36,900 INFO L87 Difference]: Start difference. First operand has 115 states, 113 states have (on average 1.752212389380531) internal successors, (198), 114 states have internal predecessors, (198), 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 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:34:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:36,941 INFO L93 Difference]: Finished difference Result 253 states and 415 transitions. [2025-03-16 19:34:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:36,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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 71 [2025-03-16 19:34:36,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:36,950 INFO L225 Difference]: With dead ends: 253 [2025-03-16 19:34:36,950 INFO L226 Difference]: Without dead ends: 174 [2025-03-16 19:34:36,953 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:34:36,955 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 140 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 406 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:34:36,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 406 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-16 19:34:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-16 19:34:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.456140350877193) internal successors, (249), 171 states have internal predecessors, (249), 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:34:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 249 transitions. [2025-03-16 19:34:36,982 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 249 transitions. Word has length 71 [2025-03-16 19:34:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:36,983 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 249 transitions. [2025-03-16 19:34:36,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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:34:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 249 transitions. [2025-03-16 19:34:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-16 19:34:36,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:36,985 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:34:36,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:36,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:36,986 INFO L85 PathProgramCache]: Analyzing trace with hash 723266419, now seen corresponding path program 1 times [2025-03-16 19:34:36,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:36,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074536726] [2025-03-16 19:34:36,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:36,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-16 19:34:37,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-16 19:34:37,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,132 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:34:37,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074536726] [2025-03-16 19:34:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074536726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773648136] [2025-03-16 19:34:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:37,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,135 INFO L87 Difference]: Start difference. First operand 172 states and 249 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:34:37,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,161 INFO L93 Difference]: Finished difference Result 416 states and 637 transitions. [2025-03-16 19:34:37,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2025-03-16 19:34:37,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,163 INFO L225 Difference]: With dead ends: 416 [2025-03-16 19:34:37,163 INFO L226 Difference]: Without dead ends: 286 [2025-03-16 19:34:37,163 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:34:37,164 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 96 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 349 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:34:37,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 349 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-03-16 19:34:37,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2025-03-16 19:34:37,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 1.5088339222614842) internal successors, (427), 283 states have internal predecessors, (427), 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:34:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 427 transitions. [2025-03-16 19:34:37,180 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 427 transitions. Word has length 72 [2025-03-16 19:34:37,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,180 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 427 transitions. [2025-03-16 19:34:37,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:34:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 427 transitions. [2025-03-16 19:34:37,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-16 19:34:37,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:34:37,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:34:37,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:37,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,183 INFO L85 PathProgramCache]: Analyzing trace with hash -95823111, now seen corresponding path program 1 times [2025-03-16 19:34:37,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905742672] [2025-03-16 19:34:37,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-16 19:34:37,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-16 19:34:37,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,330 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:34:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905742672] [2025-03-16 19:34:37,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905742672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186095205] [2025-03-16 19:34:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:37,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:37,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,332 INFO L87 Difference]: Start difference. First operand 284 states and 427 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:34:37,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,356 INFO L93 Difference]: Finished difference Result 736 states and 1145 transitions. [2025-03-16 19:34:37,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:37,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2025-03-16 19:34:37,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,361 INFO L225 Difference]: With dead ends: 736 [2025-03-16 19:34:37,361 INFO L226 Difference]: Without dead ends: 494 [2025-03-16 19:34:37,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,364 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 91 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 345 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:34:37,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 345 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:37,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2025-03-16 19:34:37,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2025-03-16 19:34:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 491 states have (on average 1.5376782077393076) internal successors, (755), 491 states have internal predecessors, (755), 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:34:37,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 755 transitions. [2025-03-16 19:34:37,383 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 755 transitions. Word has length 73 [2025-03-16 19:34:37,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,383 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 755 transitions. [2025-03-16 19:34:37,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:34:37,384 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 755 transitions. [2025-03-16 19:34:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-16 19:34:37,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,384 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, 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:34:37,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:34:37,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:37,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,385 INFO L85 PathProgramCache]: Analyzing trace with hash 947690080, now seen corresponding path program 1 times [2025-03-16 19:34:37,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354015620] [2025-03-16 19:34:37,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-16 19:34:37,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-16 19:34:37,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,502 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:34:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354015620] [2025-03-16 19:34:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354015620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:37,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711827470] [2025-03-16 19:34:37,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:37,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,505 INFO L87 Difference]: Start difference. First operand 492 states and 755 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:34:37,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,526 INFO L93 Difference]: Finished difference Result 1328 states and 2077 transitions. [2025-03-16 19:34:37,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:37,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2025-03-16 19:34:37,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,530 INFO L225 Difference]: With dead ends: 1328 [2025-03-16 19:34:37,530 INFO L226 Difference]: Without dead ends: 878 [2025-03-16 19:34:37,531 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:34:37,531 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 86 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 341 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:34:37,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 341 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2025-03-16 19:34:37,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 876. [2025-03-16 19:34:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.5485714285714285) internal successors, (1355), 875 states have internal predecessors, (1355), 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:34:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1355 transitions. [2025-03-16 19:34:37,557 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1355 transitions. Word has length 74 [2025-03-16 19:34:37,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,557 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1355 transitions. [2025-03-16 19:34:37,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:34:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1355 transitions. [2025-03-16 19:34:37,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-03-16 19:34:37,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,561 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, 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:34:37,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:34:37,561 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:37,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,562 INFO L85 PathProgramCache]: Analyzing trace with hash 24405126, now seen corresponding path program 1 times [2025-03-16 19:34:37,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112671494] [2025-03-16 19:34:37,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-16 19:34:37,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-16 19:34:37,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,663 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:34:37,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112671494] [2025-03-16 19:34:37,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112671494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:37,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125620471] [2025-03-16 19:34:37,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:37,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:37,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,666 INFO L87 Difference]: Start difference. First operand 876 states and 1355 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:34:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,692 INFO L93 Difference]: Finished difference Result 2416 states and 3773 transitions. [2025-03-16 19:34:37,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:37,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 75 [2025-03-16 19:34:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,700 INFO L225 Difference]: With dead ends: 2416 [2025-03-16 19:34:37,701 INFO L226 Difference]: Without dead ends: 1582 [2025-03-16 19:34:37,702 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:34:37,704 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 81 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 337 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:34:37,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 337 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:37,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2025-03-16 19:34:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1580. [2025-03-16 19:34:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.5471817606079796) internal successors, (2443), 1579 states have internal predecessors, (2443), 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:34:37,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2443 transitions. [2025-03-16 19:34:37,742 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2443 transitions. Word has length 75 [2025-03-16 19:34:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2443 transitions. [2025-03-16 19:34:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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:34:37,744 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2443 transitions. [2025-03-16 19:34:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-16 19:34:37,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,745 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, 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:34:37,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:34:37,746 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:37,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1933826637, now seen corresponding path program 1 times [2025-03-16 19:34:37,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428656474] [2025-03-16 19:34:37,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-16 19:34:37,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-16 19:34:37,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:37,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:37,849 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:34:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:37,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428656474] [2025-03-16 19:34:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428656474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707857836] [2025-03-16 19:34:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:37,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:37,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:37,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:37,852 INFO L87 Difference]: Start difference. First operand 1580 states and 2443 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:34:37,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:37,884 INFO L93 Difference]: Finished difference Result 4400 states and 6829 transitions. [2025-03-16 19:34:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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 76 [2025-03-16 19:34:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:37,894 INFO L225 Difference]: With dead ends: 4400 [2025-03-16 19:34:37,894 INFO L226 Difference]: Without dead ends: 2862 [2025-03-16 19:34:37,897 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:34:37,898 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 76 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 333 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:34:37,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 333 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:37,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-03-16 19:34:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2860. [2025-03-16 19:34:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2859 states have (on average 1.5372507869884575) internal successors, (4395), 2859 states have internal predecessors, (4395), 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:34:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 4395 transitions. [2025-03-16 19:34:37,968 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 4395 transitions. Word has length 76 [2025-03-16 19:34:37,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:37,968 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 4395 transitions. [2025-03-16 19:34:37,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 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:34:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 4395 transitions. [2025-03-16 19:34:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-16 19:34:37,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:37,969 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, 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:34:37,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:34:37,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:37,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1604302611, now seen corresponding path program 1 times [2025-03-16 19:34:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:37,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943561587] [2025-03-16 19:34:37,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:37,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:37,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-16 19:34:38,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-16 19:34:38,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:38,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:38,167 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:34:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:38,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943561587] [2025-03-16 19:34:38,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943561587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:38,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:38,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129178388] [2025-03-16 19:34:38,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:38,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:38,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:38,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:38,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:38,170 INFO L87 Difference]: Start difference. First operand 2860 states and 4395 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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:34:38,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:38,565 INFO L93 Difference]: Finished difference Result 36676 states and 56631 transitions. [2025-03-16 19:34:38,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 19:34:38,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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:34:38,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:38,697 INFO L225 Difference]: With dead ends: 36676 [2025-03-16 19:34:38,698 INFO L226 Difference]: Without dead ends: 33858 [2025-03-16 19:34:38,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-16 19:34:38,706 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 1491 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1491 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:38,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1491 Valid, 2692 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33858 states. [2025-03-16 19:34:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33858 to 5676. [2025-03-16 19:34:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5676 states, 5675 states have (on average 1.5187665198237885) internal successors, (8619), 5675 states have internal predecessors, (8619), 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:34:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5676 states to 5676 states and 8619 transitions. [2025-03-16 19:34:38,926 INFO L78 Accepts]: Start accepts. Automaton has 5676 states and 8619 transitions. Word has length 77 [2025-03-16 19:34:38,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:38,926 INFO L471 AbstractCegarLoop]: Abstraction has 5676 states and 8619 transitions. [2025-03-16 19:34:38,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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:34:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5676 states and 8619 transitions. [2025-03-16 19:34:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:38,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:38,927 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, 1, 1, 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:34:38,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:34:38,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:38,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash -119566564, now seen corresponding path program 1 times [2025-03-16 19:34:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:38,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787051765] [2025-03-16 19:34:38,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:38,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:38,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:38,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:38,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:38,995 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:34:38,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:38,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787051765] [2025-03-16 19:34:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787051765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:38,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:38,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:34:38,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336790744] [2025-03-16 19:34:38,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:38,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:34:38,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:38,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:34:38,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:34:38,996 INFO L87 Difference]: Start difference. First operand 5676 states and 8619 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:34:39,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,033 INFO L93 Difference]: Finished difference Result 14034 states and 21327 transitions. [2025-03-16 19:34:39,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:34:39,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:34:39,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,045 INFO L225 Difference]: With dead ends: 14034 [2025-03-16 19:34:39,045 INFO L226 Difference]: Without dead ends: 8400 [2025-03-16 19:34:39,054 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:34:39,054 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 67 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 297 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:39,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2025-03-16 19:34:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 8398. [2025-03-16 19:34:39,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8398 states, 8397 states have (on average 1.5068476836965583) internal successors, (12653), 8397 states have internal predecessors, (12653), 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:34:39,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12653 transitions. [2025-03-16 19:34:39,167 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12653 transitions. Word has length 79 [2025-03-16 19:34:39,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,169 INFO L471 AbstractCegarLoop]: Abstraction has 8398 states and 12653 transitions. [2025-03-16 19:34:39,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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:34:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12653 transitions. [2025-03-16 19:34:39,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 19:34:39,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,170 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, 1, 1, 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:34:39,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:34:39,170 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:39,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,171 INFO L85 PathProgramCache]: Analyzing trace with hash -118404715, now seen corresponding path program 1 times [2025-03-16 19:34:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488940266] [2025-03-16 19:34:39,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-16 19:34:39,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-16 19:34:39,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:39,477 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:34:39,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:39,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488940266] [2025-03-16 19:34:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488940266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:39,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:39,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:39,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987206703] [2025-03-16 19:34:39,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:39,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:39,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:39,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:39,479 INFO L87 Difference]: Start difference. First operand 8398 states and 12653 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:34:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:39,705 INFO L93 Difference]: Finished difference Result 16754 states and 25263 transitions. [2025-03-16 19:34:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:39,705 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:34:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:39,717 INFO L225 Difference]: With dead ends: 16754 [2025-03-16 19:34:39,717 INFO L226 Difference]: Without dead ends: 8400 [2025-03-16 19:34:39,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-16 19:34:39,728 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 316 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:39,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 683 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:39,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8400 states. [2025-03-16 19:34:39,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8400 to 8398. [2025-03-16 19:34:39,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8398 states, 8397 states have (on average 1.4954150291770871) internal successors, (12557), 8397 states have internal predecessors, (12557), 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:34:39,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 12557 transitions. [2025-03-16 19:34:39,868 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 12557 transitions. Word has length 79 [2025-03-16 19:34:39,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:39,868 INFO L471 AbstractCegarLoop]: Abstraction has 8398 states and 12557 transitions. [2025-03-16 19:34:39,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 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:34:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 12557 transitions. [2025-03-16 19:34:39,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-16 19:34:39,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:39,869 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, 1, 1, 1, 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:34:39,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:34:39,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:39,870 INFO L85 PathProgramCache]: Analyzing trace with hash 625376501, now seen corresponding path program 1 times [2025-03-16 19:34:39,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647709218] [2025-03-16 19:34:39,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:39,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:39,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-16 19:34:39,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-16 19:34:39,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:39,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,079 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:34:40,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647709218] [2025-03-16 19:34:40,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647709218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:34:40,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713753500] [2025-03-16 19:34:40,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:34:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:34:40,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:34:40,081 INFO L87 Difference]: Start difference. First operand 8398 states and 12557 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:34:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:40,113 INFO L93 Difference]: Finished difference Result 8656 states and 12942 transitions. [2025-03-16 19:34:40,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 19:34:40,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:34:40,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:40,126 INFO L225 Difference]: With dead ends: 8656 [2025-03-16 19:34:40,126 INFO L226 Difference]: Without dead ends: 8654 [2025-03-16 19:34:40,128 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:34:40,129 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:40,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 588 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8654 states. [2025-03-16 19:34:40,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8654 to 8654. [2025-03-16 19:34:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8654 states, 8653 states have (on average 1.477059979197966) internal successors, (12781), 8653 states have internal predecessors, (12781), 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:34:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8654 states to 8654 states and 12781 transitions. [2025-03-16 19:34:40,219 INFO L78 Accepts]: Start accepts. Automaton has 8654 states and 12781 transitions. Word has length 80 [2025-03-16 19:34:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:40,220 INFO L471 AbstractCegarLoop]: Abstraction has 8654 states and 12781 transitions. [2025-03-16 19:34:40,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:34:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8654 states and 12781 transitions. [2025-03-16 19:34:40,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:40,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:40,224 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:40,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:34:40,225 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:40,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1735201899, now seen corresponding path program 1 times [2025-03-16 19:34:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:40,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212325972] [2025-03-16 19:34:40,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:40,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:40,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:40,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:40,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:40,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 19:34:40,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:40,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212325972] [2025-03-16 19:34:40,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212325972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:40,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:40,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:40,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242831668] [2025-03-16 19:34:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:40,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:40,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:40,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:40,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:40,424 INFO L87 Difference]: Start difference. First operand 8654 states and 12781 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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:34:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:40,667 INFO L93 Difference]: Finished difference Result 61916 states and 91476 transitions. [2025-03-16 19:34:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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 110 [2025-03-16 19:34:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:40,747 INFO L225 Difference]: With dead ends: 61916 [2025-03-16 19:34:40,747 INFO L226 Difference]: Without dead ends: 53306 [2025-03-16 19:34:40,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:40,770 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 1124 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:40,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 1635 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53306 states. [2025-03-16 19:34:41,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53306 to 17262. [2025-03-16 19:34:41,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17262 states, 17261 states have (on average 1.472742019581716) internal successors, (25421), 17261 states have internal predecessors, (25421), 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:34:41,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17262 states to 17262 states and 25421 transitions. [2025-03-16 19:34:41,196 INFO L78 Accepts]: Start accepts. Automaton has 17262 states and 25421 transitions. Word has length 110 [2025-03-16 19:34:41,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:41,196 INFO L471 AbstractCegarLoop]: Abstraction has 17262 states and 25421 transitions. [2025-03-16 19:34:41,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 8 states have internal predecessors, (108), 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:34:41,197 INFO L276 IsEmpty]: Start isEmpty. Operand 17262 states and 25421 transitions. [2025-03-16 19:34:41,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:41,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:41,201 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:41,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:34:41,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:41,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:41,202 INFO L85 PathProgramCache]: Analyzing trace with hash 373681973, now seen corresponding path program 1 times [2025-03-16 19:34:41,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:41,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924352305] [2025-03-16 19:34:41,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:41,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:41,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:41,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:41,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:41,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 19:34:41,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:41,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924352305] [2025-03-16 19:34:41,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924352305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:41,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:41,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:41,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301939504] [2025-03-16 19:34:41,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:41,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:41,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:41,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:41,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:41,369 INFO L87 Difference]: Start difference. First operand 17262 states and 25421 transitions. Second operand has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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:34:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:41,624 INFO L93 Difference]: Finished difference Result 70524 states and 104116 transitions. [2025-03-16 19:34:41,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:41,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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 110 [2025-03-16 19:34:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:41,836 INFO L225 Difference]: With dead ends: 70524 [2025-03-16 19:34:41,836 INFO L226 Difference]: Without dead ends: 61914 [2025-03-16 19:34:41,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:41,848 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1153 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:41,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1519 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61914 states. [2025-03-16 19:34:42,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61914 to 30190. [2025-03-16 19:34:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30190 states, 30189 states have (on average 1.4674550332902714) internal successors, (44301), 30189 states have internal predecessors, (44301), 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:34:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30190 states to 30190 states and 44301 transitions. [2025-03-16 19:34:42,299 INFO L78 Accepts]: Start accepts. Automaton has 30190 states and 44301 transitions. Word has length 110 [2025-03-16 19:34:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:42,299 INFO L471 AbstractCegarLoop]: Abstraction has 30190 states and 44301 transitions. [2025-03-16 19:34:42,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.375) internal successors, (107), 8 states have internal predecessors, (107), 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:34:42,299 INFO L276 IsEmpty]: Start isEmpty. Operand 30190 states and 44301 transitions. [2025-03-16 19:34:42,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:42,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:42,305 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:42,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:34:42,305 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:42,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 2018230997, now seen corresponding path program 1 times [2025-03-16 19:34:42,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:42,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854575956] [2025-03-16 19:34:42,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:42,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:42,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:42,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:42,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-16 19:34:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854575956] [2025-03-16 19:34:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854575956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695375628] [2025-03-16 19:34:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:42,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:42,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:42,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:42,486 INFO L87 Difference]: Start difference. First operand 30190 states and 44301 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:34:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:42,801 INFO L93 Difference]: Finished difference Result 79132 states and 116756 transitions. [2025-03-16 19:34:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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 110 [2025-03-16 19:34:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:43,024 INFO L225 Difference]: With dead ends: 79132 [2025-03-16 19:34:43,025 INFO L226 Difference]: Without dead ends: 70522 [2025-03-16 19:34:43,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:43,038 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 1208 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:43,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 1445 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70522 states. [2025-03-16 19:34:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70522 to 38798. [2025-03-16 19:34:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38798 states, 38797 states have (on average 1.4676650256463128) internal successors, (56941), 38797 states have internal predecessors, (56941), 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:34:43,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38798 states to 38798 states and 56941 transitions. [2025-03-16 19:34:43,607 INFO L78 Accepts]: Start accepts. Automaton has 38798 states and 56941 transitions. Word has length 110 [2025-03-16 19:34:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:43,607 INFO L471 AbstractCegarLoop]: Abstraction has 38798 states and 56941 transitions. [2025-03-16 19:34:43,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 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:34:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 38798 states and 56941 transitions. [2025-03-16 19:34:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:43,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:43,613 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:43,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:34:43,613 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:43,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:43,614 INFO L85 PathProgramCache]: Analyzing trace with hash -125016459, now seen corresponding path program 1 times [2025-03-16 19:34:43,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:43,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49822402] [2025-03-16 19:34:43,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:43,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:43,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:43,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:43,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:43,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-16 19:34:43,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:43,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49822402] [2025-03-16 19:34:43,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49822402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:43,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:43,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:43,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079756248] [2025-03-16 19:34:43,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:43,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:43,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:43,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:43,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:43,875 INFO L87 Difference]: Start difference. First operand 38798 states and 56941 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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:34:44,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:44,153 INFO L93 Difference]: Finished difference Result 87740 states and 129396 transitions. [2025-03-16 19:34:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:44,154 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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 110 [2025-03-16 19:34:44,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:44,250 INFO L225 Difference]: With dead ends: 87740 [2025-03-16 19:34:44,250 INFO L226 Difference]: Without dead ends: 79130 [2025-03-16 19:34:44,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:44,285 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 1276 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 1463 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:44,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 1463 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79130 states. [2025-03-16 19:34:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79130 to 47406. [2025-03-16 19:34:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47406 states, 47405 states have (on average 1.4677987554055478) internal successors, (69581), 47405 states have internal predecessors, (69581), 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:34:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47406 states to 47406 states and 69581 transitions. [2025-03-16 19:34:45,137 INFO L78 Accepts]: Start accepts. Automaton has 47406 states and 69581 transitions. Word has length 110 [2025-03-16 19:34:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 47406 states and 69581 transitions. [2025-03-16 19:34:45,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 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:34:45,137 INFO L276 IsEmpty]: Start isEmpty. Operand 47406 states and 69581 transitions. [2025-03-16 19:34:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:45,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:45,143 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:45,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 19:34:45,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:45,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:45,143 INFO L85 PathProgramCache]: Analyzing trace with hash 82827797, now seen corresponding path program 1 times [2025-03-16 19:34:45,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:45,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832756599] [2025-03-16 19:34:45,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:45,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:45,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:45,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:45,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:45,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 19:34:45,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:45,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832756599] [2025-03-16 19:34:45,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832756599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:45,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:45,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:45,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600365931] [2025-03-16 19:34:45,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:45,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:45,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:45,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:45,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:45,308 INFO L87 Difference]: Start difference. First operand 47406 states and 69581 transitions. Second operand has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:45,669 INFO L93 Difference]: Finished difference Result 96348 states and 142036 transitions. [2025-03-16 19:34:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:45,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:34:45,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:45,769 INFO L225 Difference]: With dead ends: 96348 [2025-03-16 19:34:45,769 INFO L226 Difference]: Without dead ends: 87738 [2025-03-16 19:34:45,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:45,805 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 1144 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1601 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:45,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1601 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:45,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87738 states. [2025-03-16 19:34:46,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87738 to 56014. [2025-03-16 19:34:46,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56014 states, 56013 states have (on average 1.467891382357667) internal successors, (82221), 56013 states have internal predecessors, (82221), 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:34:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56014 states to 56014 states and 82221 transitions. [2025-03-16 19:34:46,688 INFO L78 Accepts]: Start accepts. Automaton has 56014 states and 82221 transitions. Word has length 110 [2025-03-16 19:34:46,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:46,688 INFO L471 AbstractCegarLoop]: Abstraction has 56014 states and 82221 transitions. [2025-03-16 19:34:46,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.0) internal successors, (104), 8 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 56014 states and 82221 transitions. [2025-03-16 19:34:46,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-16 19:34:46,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:46,694 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 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:34:46,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 19:34:46,694 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:46,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:46,694 INFO L85 PathProgramCache]: Analyzing trace with hash -112543755, now seen corresponding path program 1 times [2025-03-16 19:34:46,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:46,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572347204] [2025-03-16 19:34:46,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:46,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:46,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-16 19:34:46,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-16 19:34:46,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:46,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:46,854 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:34:46,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:46,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572347204] [2025-03-16 19:34:46,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572347204] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:34:46,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:34:46,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 19:34:46,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626100840] [2025-03-16 19:34:46,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:34:46,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 19:34:46,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:46,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 19:34:46,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-16 19:34:46,856 INFO L87 Difference]: Start difference. First operand 56014 states and 82221 transitions. Second operand has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:47,212 INFO L93 Difference]: Finished difference Result 99516 states and 146740 transitions. [2025-03-16 19:34:47,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 19:34:47,212 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2025-03-16 19:34:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:47,314 INFO L225 Difference]: With dead ends: 99516 [2025-03-16 19:34:47,314 INFO L226 Difference]: Without dead ends: 93626 [2025-03-16 19:34:47,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-16 19:34:47,346 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 1123 mSDsluCounter, 1637 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:47,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1892 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 19:34:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93626 states. [2025-03-16 19:34:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93626 to 61902. [2025-03-16 19:34:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61902 states, 61901 states have (on average 1.4688777241078497) internal successors, (90925), 61901 states have internal predecessors, (90925), 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:34:48,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61902 states to 61902 states and 90925 transitions. [2025-03-16 19:34:48,605 INFO L78 Accepts]: Start accepts. Automaton has 61902 states and 90925 transitions. Word has length 110 [2025-03-16 19:34:48,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:48,605 INFO L471 AbstractCegarLoop]: Abstraction has 61902 states and 90925 transitions. [2025-03-16 19:34:48,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.625) internal successors, (109), 8 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 19:34:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand 61902 states and 90925 transitions. [2025-03-16 19:34:48,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-16 19:34:48,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:48,611 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, 1, 1, 1, 1, 1, 1, 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:34:48,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 19:34:48,611 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:48,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:48,611 INFO L85 PathProgramCache]: Analyzing trace with hash -891856760, now seen corresponding path program 1 times [2025-03-16 19:34:48,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:48,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710465746] [2025-03-16 19:34:48,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:48,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:48,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:34:48,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:34:48,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:48,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:48,756 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:34:48,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710465746] [2025-03-16 19:34:48,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710465746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:34:48,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041633828] [2025-03-16 19:34:48,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:34:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:48,759 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:34:48,760 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:34:48,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-16 19:34:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-16 19:34:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:48,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-16 19:34:48,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:34:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:34:49,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:34:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 19:34:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041633828] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:34:49,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:34:49,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-16 19:34:49,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390966923] [2025-03-16 19:34:49,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:34:49,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 19:34:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:49,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 19:34:49,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:34:49,490 INFO L87 Difference]: Start difference. First operand 61902 states and 90925 transitions. Second operand has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 9 states have internal predecessors, (318), 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:34:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:34:50,146 INFO L93 Difference]: Finished difference Result 226168 states and 334290 transitions. [2025-03-16 19:34:50,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 19:34:50,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 9 states have internal predecessors, (318), 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 111 [2025-03-16 19:34:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:34:50,514 INFO L225 Difference]: With dead ends: 226168 [2025-03-16 19:34:50,514 INFO L226 Difference]: Without dead ends: 182006 [2025-03-16 19:34:50,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-03-16 19:34:50,568 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 522 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:34:50,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 937 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:34:50,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182006 states. [2025-03-16 19:34:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182006 to 181998. [2025-03-16 19:34:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181998 states, 181997 states have (on average 1.4539855052555812) internal successors, (264621), 181997 states have internal predecessors, (264621), 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:34:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181998 states to 181998 states and 264621 transitions. [2025-03-16 19:34:52,447 INFO L78 Accepts]: Start accepts. Automaton has 181998 states and 264621 transitions. Word has length 111 [2025-03-16 19:34:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:34:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 181998 states and 264621 transitions. [2025-03-16 19:34:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.333333333333336) internal successors, (318), 9 states have internal predecessors, (318), 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:34:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 181998 states and 264621 transitions. [2025-03-16 19:34:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-16 19:34:52,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:34:52,453 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:52,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 19:34:52,654 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,SelfDestructingSolverStorable16 [2025-03-16 19:34:52,654 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:34:52,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:34:52,655 INFO L85 PathProgramCache]: Analyzing trace with hash -2025698511, now seen corresponding path program 1 times [2025-03-16 19:34:52,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:34:52,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875710896] [2025-03-16 19:34:52,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:52,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:34:52,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:34:52,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:34:52,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:52,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:53,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:34:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875710896] [2025-03-16 19:34:53,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875710896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 19:34:53,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600736041] [2025-03-16 19:34:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:34:53,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 19:34:53,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:34:53,365 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:34:53,367 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:34:53,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-16 19:34:53,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-16 19:34:53,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:34:53,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:34:53,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 19:34:53,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 19:34:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:53,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 19:34:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:34:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600736041] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 19:34:55,030 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 19:34:55,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 26 [2025-03-16 19:34:55,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763673472] [2025-03-16 19:34:55,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 19:34:55,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-16 19:34:55,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:34:55,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-16 19:34:55,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2025-03-16 19:34:55,035 INFO L87 Difference]: Start difference. First operand 181998 states and 264621 transitions. Second operand has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 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:35:03,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:35:03,680 INFO L93 Difference]: Finished difference Result 2056054 states and 2956129 transitions. [2025-03-16 19:35:03,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2025-03-16 19:35:03,681 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 10.962962962962964) internal successors, (296), 26 states have internal predecessors, (296), 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 112 [2025-03-16 19:35:03,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:35:07,109 INFO L225 Difference]: With dead ends: 2056054 [2025-03-16 19:35:07,109 INFO L226 Difference]: Without dead ends: 1874100 [2025-03-16 19:35:07,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8933 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3326, Invalid=19626, Unknown=0, NotChecked=0, Total=22952 [2025-03-16 19:35:07,382 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 3836 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2852 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3836 SdHoareTripleChecker+Valid, 1784 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:35:07,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3836 Valid, 1784 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2852 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 19:35:08,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874100 states. [2025-03-16 19:35:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874100 to 891586. [2025-03-16 19:35:22,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891586 states, 891585 states have (on average 1.42859402076078) internal successors, (1273713), 891585 states have internal predecessors, (1273713), 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)