./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-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 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:57:11,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:57:11,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:57:11,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:57:11,732 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:57:11,756 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:57:11,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:57:11,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:57:11,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:57:11,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:57:11,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:57:11,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:57:11,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:57:11,761 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:57:11,761 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:57:11,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:57:11,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:57:11,762 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:57:11,762 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:57:11,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:57:11,763 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:57:11,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:57:11,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:57:11,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:57:11,767 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:57:11,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:57:11,768 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:57:11,768 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:57:11,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:57:11,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:57:11,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:57:11,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:57:11,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:11,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:57:11,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:57:11,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:57:11,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:57:11,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:57:11,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:57:11,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:57:11,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:57:11,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:57:11,771 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 233676c1e8a1b5798ecf495818fb18bbff45b7aea47a9aff904b2f64a9e366a2 [2024-11-09 23:57:11,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:57:11,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:57:11,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:57:11,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:57:11,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:57:11,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:57:13,188 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:57:13,340 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:57:13,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:57:13,353 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b099a3402/f86c6e861700465b889b055d69b5a52b/FLAGfc34081bd [2024-11-09 23:57:13,364 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b099a3402/f86c6e861700465b889b055d69b5a52b [2024-11-09 23:57:13,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:57:13,367 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:57:13,368 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:13,368 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:57:13,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:57:13,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1024839b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13, skipping insertion in model container [2024-11-09 23:57:13,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:57:13,596 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2024-11-09 23:57:13,609 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2024-11-09 23:57:13,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:13,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:57:13,666 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[6876,6889] [2024-11-09 23:57:13,671 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.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9071,9084] [2024-11-09 23:57:13,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:13,694 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:57:13,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13 WrapperNode [2024-11-09 23:57:13,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:13,695 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:13,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:57:13,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:57:13,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,730 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 485 [2024-11-09 23:57:13,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:13,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:57:13,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:57:13,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:57:13,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,761 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]. [2024-11-09 23:57:13,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,766 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:57:13,772 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:57:13,773 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:57:13,773 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:57:13,773 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (1/1) ... [2024-11-09 23:57:13,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:13,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:13,820 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) [2024-11-09 23:57:13,823 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 [2024-11-09 23:57:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:57:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:57:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:57:13,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:57:13,969 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:57:13,971 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:57:14,352 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L333: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L235: havoc main_~node2__m2~1#1;havoc main_~node1__m1~1#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:14,353 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L203: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L484: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L535: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:14,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:14,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:14,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:14,355 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L439: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,356 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,357 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,357 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,357 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,357 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L126: havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L573: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1; [2024-11-09 23:57:14,358 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:14,359 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L144: havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-09 23:57:14,359 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L298: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:57:14,359 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L298: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:57:14,359 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L298: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:57:14,359 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L298: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1;havoc main_~node3__m3~1#1; [2024-11-09 23:57:14,383 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2024-11-09 23:57:14,383 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:57:14,393 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:57:14,393 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:57:14,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:14 BoogieIcfgContainer [2024-11-09 23:57:14,394 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:57:14,395 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:57:14,395 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:57:14,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:57:14,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:57:13" (1/3) ... [2024-11-09 23:57:14,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf6438b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:14, skipping insertion in model container [2024-11-09 23:57:14,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:13" (2/3) ... [2024-11-09 23:57:14,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cf6438b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:14, skipping insertion in model container [2024-11-09 23:57:14,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:14" (3/3) ... [2024-11-09 23:57:14,399 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2024-11-09 23:57:14,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:57:14,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 23:57:14,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:57:14,463 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;@6c1d92c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:57:14,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 23:57:14,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 108 states have (on average 1.712962962962963) internal successors, (185), 110 states have internal predecessors, (185), 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) [2024-11-09 23:57:14,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:57:14,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:14,472 INFO L215 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] [2024-11-09 23:57:14,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:14,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:14,477 INFO L85 PathProgramCache]: Analyzing trace with hash 226233946, now seen corresponding path program 1 times [2024-11-09 23:57:14,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:14,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621821761] [2024-11-09 23:57:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:14,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:14,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:14,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621821761] [2024-11-09 23:57:14,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621821761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98830072] [2024-11-09 23:57:14,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:14,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:14,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:14,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:14,965 INFO L87 Difference]: Start difference. First operand has 111 states, 108 states have (on average 1.712962962962963) internal successors, (185), 110 states have internal predecessors, (185), 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 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:15,155 INFO L93 Difference]: Finished difference Result 445 states and 691 transitions. [2024-11-09 23:57:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:57:15,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 23:57:15,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:15,166 INFO L225 Difference]: With dead ends: 445 [2024-11-09 23:57:15,166 INFO L226 Difference]: Without dead ends: 376 [2024-11-09 23:57:15,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:57:15,171 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 602 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:15,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [602 Valid, 1034 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-09 23:57:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 162. [2024-11-09 23:57:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.425) internal successors, (228), 161 states have internal predecessors, (228), 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) [2024-11-09 23:57:15,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 228 transitions. [2024-11-09 23:57:15,205 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 228 transitions. Word has length 47 [2024-11-09 23:57:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:15,206 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 228 transitions. [2024-11-09 23:57:15,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 228 transitions. [2024-11-09 23:57:15,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 23:57:15,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:15,207 INFO L215 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] [2024-11-09 23:57:15,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:57:15,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:15,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1572126165, now seen corresponding path program 1 times [2024-11-09 23:57:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:15,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828780901] [2024-11-09 23:57:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:15,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:15,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828780901] [2024-11-09 23:57:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828780901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:15,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:15,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:15,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12727727] [2024-11-09 23:57:15,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:15,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:15,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:15,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:15,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:15,311 INFO L87 Difference]: Start difference. First operand 162 states and 228 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:15,357 INFO L93 Difference]: Finished difference Result 259 states and 371 transitions. [2024-11-09 23:57:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:15,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-09 23:57:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:15,359 INFO L225 Difference]: With dead ends: 259 [2024-11-09 23:57:15,359 INFO L226 Difference]: Without dead ends: 166 [2024-11-09 23:57:15,360 INFO L431 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 [2024-11-09 23:57:15,362 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 78 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:15,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 314 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-09 23:57:15,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2024-11-09 23:57:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.4135802469135803) internal successors, (229), 163 states have internal predecessors, (229), 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) [2024-11-09 23:57:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 229 transitions. [2024-11-09 23:57:15,370 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 229 transitions. Word has length 48 [2024-11-09 23:57:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:15,370 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 229 transitions. [2024-11-09 23:57:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 229 transitions. [2024-11-09 23:57:15,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:15,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:15,371 INFO L215 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] [2024-11-09 23:57:15,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:57:15,372 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:15,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:15,372 INFO L85 PathProgramCache]: Analyzing trace with hash 311675327, now seen corresponding path program 1 times [2024-11-09 23:57:15,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:15,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936314076] [2024-11-09 23:57:15,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:15,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:15,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:15,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936314076] [2024-11-09 23:57:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936314076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:15,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:15,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004681830] [2024-11-09 23:57:15,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:15,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:15,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:15,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:15,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:15,522 INFO L87 Difference]: Start difference. First operand 164 states and 229 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:15,640 INFO L93 Difference]: Finished difference Result 505 states and 734 transitions. [2024-11-09 23:57:15,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:15,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:15,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:15,642 INFO L225 Difference]: With dead ends: 505 [2024-11-09 23:57:15,642 INFO L226 Difference]: Without dead ends: 415 [2024-11-09 23:57:15,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:15,644 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 373 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:15,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 716 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-09 23:57:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 263. [2024-11-09 23:57:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 261 states have (on average 1.4482758620689655) internal successors, (378), 262 states have internal predecessors, (378), 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) [2024-11-09 23:57:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 378 transitions. [2024-11-09 23:57:15,662 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 378 transitions. Word has length 49 [2024-11-09 23:57:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:15,662 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 378 transitions. [2024-11-09 23:57:15,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 378 transitions. [2024-11-09 23:57:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:15,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:15,664 INFO L215 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] [2024-11-09 23:57:15,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:57:15,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:15,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:15,665 INFO L85 PathProgramCache]: Analyzing trace with hash 226142550, now seen corresponding path program 1 times [2024-11-09 23:57:15,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:15,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266480268] [2024-11-09 23:57:15,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:15,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:15,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266480268] [2024-11-09 23:57:15,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266480268] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:15,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:15,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481819041] [2024-11-09 23:57:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:15,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:15,792 INFO L87 Difference]: Start difference. First operand 263 states and 378 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:15,860 INFO L93 Difference]: Finished difference Result 604 states and 883 transitions. [2024-11-09 23:57:15,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:15,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:15,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:15,862 INFO L225 Difference]: With dead ends: 604 [2024-11-09 23:57:15,862 INFO L226 Difference]: Without dead ends: 514 [2024-11-09 23:57:15,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:15,863 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 378 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:15,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 505 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-09 23:57:15,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 408. [2024-11-09 23:57:15,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 406 states have (on average 1.4655172413793103) internal successors, (595), 407 states have internal predecessors, (595), 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) [2024-11-09 23:57:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 595 transitions. [2024-11-09 23:57:15,879 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 595 transitions. Word has length 49 [2024-11-09 23:57:15,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:15,879 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 595 transitions. [2024-11-09 23:57:15,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:15,880 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 595 transitions. [2024-11-09 23:57:15,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:15,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:15,881 INFO L215 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] [2024-11-09 23:57:15,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:57:15,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:15,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:15,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1198306881, now seen corresponding path program 1 times [2024-11-09 23:57:15,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:15,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899721972] [2024-11-09 23:57:15,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899721972] [2024-11-09 23:57:15,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899721972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960956412] [2024-11-09 23:57:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:15,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:15,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:15,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:15,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:15,999 INFO L87 Difference]: Start difference. First operand 408 states and 595 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:16,077 INFO L93 Difference]: Finished difference Result 698 states and 1024 transitions. [2024-11-09 23:57:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:16,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:16,080 INFO L225 Difference]: With dead ends: 698 [2024-11-09 23:57:16,080 INFO L226 Difference]: Without dead ends: 608 [2024-11-09 23:57:16,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:16,082 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 368 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:16,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 599 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-09 23:57:16,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 502. [2024-11-09 23:57:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 500 states have (on average 1.472) internal successors, (736), 501 states have internal predecessors, (736), 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) [2024-11-09 23:57:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 736 transitions. [2024-11-09 23:57:16,105 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 736 transitions. Word has length 49 [2024-11-09 23:57:16,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:16,105 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 736 transitions. [2024-11-09 23:57:16,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 736 transitions. [2024-11-09 23:57:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 23:57:16,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:16,106 INFO L215 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] [2024-11-09 23:57:16,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:57:16,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:16,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:16,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1076556646, now seen corresponding path program 1 times [2024-11-09 23:57:16,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:16,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922759706] [2024-11-09 23:57:16,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:16,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:16,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:16,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922759706] [2024-11-09 23:57:16,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922759706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:16,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:16,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687426820] [2024-11-09 23:57:16,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:16,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:16,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:16,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:16,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:16,203 INFO L87 Difference]: Start difference. First operand 502 states and 736 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:16,321 INFO L93 Difference]: Finished difference Result 1422 states and 2107 transitions. [2024-11-09 23:57:16,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:16,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-09 23:57:16,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:16,323 INFO L225 Difference]: With dead ends: 1422 [2024-11-09 23:57:16,324 INFO L226 Difference]: Without dead ends: 942 [2024-11-09 23:57:16,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:16,327 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 583 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:16,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 143 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-09 23:57:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 937. [2024-11-09 23:57:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.477005347593583) internal successors, (1381), 936 states have internal predecessors, (1381), 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) [2024-11-09 23:57:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1381 transitions. [2024-11-09 23:57:16,342 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1381 transitions. Word has length 50 [2024-11-09 23:57:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:16,343 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1381 transitions. [2024-11-09 23:57:16,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1381 transitions. [2024-11-09 23:57:16,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:57:16,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:16,345 INFO L215 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] [2024-11-09 23:57:16,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:57:16,345 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:16,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:16,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1511432016, now seen corresponding path program 1 times [2024-11-09 23:57:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736628910] [2024-11-09 23:57:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:16,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736628910] [2024-11-09 23:57:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736628910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:16,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:16,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:16,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065865187] [2024-11-09 23:57:16,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:16,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:16,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:16,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:16,434 INFO L87 Difference]: Start difference. First operand 937 states and 1381 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-11-09 23:57:16,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:16,515 INFO L93 Difference]: Finished difference Result 1848 states and 2735 transitions. [2024-11-09 23:57:16,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2024-11-09 23:57:16,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:16,518 INFO L225 Difference]: With dead ends: 1848 [2024-11-09 23:57:16,518 INFO L226 Difference]: Without dead ends: 937 [2024-11-09 23:57:16,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:16,520 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 378 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:16,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 93 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-09 23:57:16,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2024-11-09 23:57:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.4566844919786097) internal successors, (1362), 936 states have internal predecessors, (1362), 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) [2024-11-09 23:57:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1362 transitions. [2024-11-09 23:57:16,534 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1362 transitions. Word has length 51 [2024-11-09 23:57:16,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:16,535 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1362 transitions. [2024-11-09 23:57:16,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 4 states have internal predecessors, (51), 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) [2024-11-09 23:57:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1362 transitions. [2024-11-09 23:57:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:16,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:16,536 INFO L215 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] [2024-11-09 23:57:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:57:16,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:16,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1193549374, now seen corresponding path program 1 times [2024-11-09 23:57:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:16,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818389174] [2024-11-09 23:57:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:16,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:16,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:16,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818389174] [2024-11-09 23:57:16,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818389174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:16,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:16,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:16,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476010094] [2024-11-09 23:57:16,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:16,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:16,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:16,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:16,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:16,616 INFO L87 Difference]: Start difference. First operand 937 states and 1362 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:16,699 INFO L93 Difference]: Finished difference Result 1844 states and 2693 transitions. [2024-11-09 23:57:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:16,702 INFO L225 Difference]: With dead ends: 1844 [2024-11-09 23:57:16,702 INFO L226 Difference]: Without dead ends: 937 [2024-11-09 23:57:16,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:16,704 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 360 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:16,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-09 23:57:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 937. [2024-11-09 23:57:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.4363636363636363) internal successors, (1343), 936 states have internal predecessors, (1343), 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) [2024-11-09 23:57:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1343 transitions. [2024-11-09 23:57:16,716 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1343 transitions. Word has length 52 [2024-11-09 23:57:16,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:16,716 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1343 transitions. [2024-11-09 23:57:16,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1343 transitions. [2024-11-09 23:57:16,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:57:16,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:16,717 INFO L215 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] [2024-11-09 23:57:16,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:57:16,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:16,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:16,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1647197205, now seen corresponding path program 1 times [2024-11-09 23:57:16,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:16,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676649525] [2024-11-09 23:57:16,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:16,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:16,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:16,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:16,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676649525] [2024-11-09 23:57:16,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676649525] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:16,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:16,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:57:16,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778666419] [2024-11-09 23:57:16,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:57:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:16,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:57:16,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:57:16,979 INFO L87 Difference]: Start difference. First operand 937 states and 1343 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:17,339 INFO L93 Difference]: Finished difference Result 2261 states and 3239 transitions. [2024-11-09 23:57:17,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:17,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 23:57:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:17,343 INFO L225 Difference]: With dead ends: 2261 [2024-11-09 23:57:17,343 INFO L226 Difference]: Without dead ends: 1413 [2024-11-09 23:57:17,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:57:17,344 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 639 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:17,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 505 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:17,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-09 23:57:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 937. [2024-11-09 23:57:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.4331550802139037) internal successors, (1340), 936 states have internal predecessors, (1340), 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) [2024-11-09 23:57:17,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1340 transitions. [2024-11-09 23:57:17,358 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1340 transitions. Word has length 53 [2024-11-09 23:57:17,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:17,359 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1340 transitions. [2024-11-09 23:57:17,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:17,359 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1340 transitions. [2024-11-09 23:57:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-09 23:57:17,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:17,359 INFO L215 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] [2024-11-09 23:57:17,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:57:17,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:17,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1004318882, now seen corresponding path program 1 times [2024-11-09 23:57:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:17,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288127189] [2024-11-09 23:57:17,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288127189] [2024-11-09 23:57:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288127189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434508276] [2024-11-09 23:57:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:17,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:17,526 INFO L87 Difference]: Start difference. First operand 937 states and 1340 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:17,731 INFO L93 Difference]: Finished difference Result 2606 states and 3760 transitions. [2024-11-09 23:57:17,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:57:17,731 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-09 23:57:17,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:17,735 INFO L225 Difference]: With dead ends: 2606 [2024-11-09 23:57:17,735 INFO L226 Difference]: Without dead ends: 1770 [2024-11-09 23:57:17,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:57:17,737 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 325 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:17,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 349 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:17,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2024-11-09 23:57:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 937. [2024-11-09 23:57:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.4320855614973262) internal successors, (1339), 936 states have internal predecessors, (1339), 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) [2024-11-09 23:57:17,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1339 transitions. [2024-11-09 23:57:17,752 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1339 transitions. Word has length 53 [2024-11-09 23:57:17,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:17,752 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1339 transitions. [2024-11-09 23:57:17,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1339 transitions. [2024-11-09 23:57:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:57:17,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:17,753 INFO L215 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] [2024-11-09 23:57:17,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:57:17,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:17,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash -826935513, now seen corresponding path program 1 times [2024-11-09 23:57:17,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964935972] [2024-11-09 23:57:17,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:17,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:17,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964935972] [2024-11-09 23:57:17,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964935972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:17,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:17,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:57:17,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446961095] [2024-11-09 23:57:17,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:17,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:57:17,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:17,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:57:17,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:57:17,912 INFO L87 Difference]: Start difference. First operand 937 states and 1339 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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) [2024-11-09 23:57:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:18,251 INFO L93 Difference]: Finished difference Result 2654 states and 3809 transitions. [2024-11-09 23:57:18,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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 54 [2024-11-09 23:57:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:18,256 INFO L225 Difference]: With dead ends: 2654 [2024-11-09 23:57:18,256 INFO L226 Difference]: Without dead ends: 1821 [2024-11-09 23:57:18,258 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:57:18,258 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 406 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:18,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 594 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:18,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2024-11-09 23:57:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 937. [2024-11-09 23:57:18,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 935 states have (on average 1.425668449197861) internal successors, (1333), 936 states have internal predecessors, (1333), 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) [2024-11-09 23:57:18,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1333 transitions. [2024-11-09 23:57:18,273 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1333 transitions. Word has length 54 [2024-11-09 23:57:18,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:18,273 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1333 transitions. [2024-11-09 23:57:18,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 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) [2024-11-09 23:57:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1333 transitions. [2024-11-09 23:57:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:18,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:18,274 INFO L215 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] [2024-11-09 23:57:18,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:57:18,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:18,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:18,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1778543620, now seen corresponding path program 1 times [2024-11-09 23:57:18,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:18,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922022253] [2024-11-09 23:57:18,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:18,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922022253] [2024-11-09 23:57:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922022253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:18,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:57:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215461171] [2024-11-09 23:57:18,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:57:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:57:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:18,720 INFO L87 Difference]: Start difference. First operand 937 states and 1333 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:19,240 INFO L93 Difference]: Finished difference Result 2130 states and 3066 transitions. [2024-11-09 23:57:19,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 23:57:19,240 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:19,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:19,244 INFO L225 Difference]: With dead ends: 2130 [2024-11-09 23:57:19,244 INFO L226 Difference]: Without dead ends: 1749 [2024-11-09 23:57:19,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:57:19,245 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 518 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:19,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1153 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2024-11-09 23:57:19,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 919. [2024-11-09 23:57:19,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 917 states have (on average 1.4231188658669576) internal successors, (1305), 918 states have internal predecessors, (1305), 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) [2024-11-09 23:57:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1305 transitions. [2024-11-09 23:57:19,259 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1305 transitions. Word has length 55 [2024-11-09 23:57:19,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:19,259 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1305 transitions. [2024-11-09 23:57:19,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,260 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1305 transitions. [2024-11-09 23:57:19,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:19,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:19,260 INFO L215 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] [2024-11-09 23:57:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:57:19,260 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:19,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash -689043276, now seen corresponding path program 1 times [2024-11-09 23:57:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639870515] [2024-11-09 23:57:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:19,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:19,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639870515] [2024-11-09 23:57:19,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639870515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:19,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:19,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-09 23:57:19,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231852648] [2024-11-09 23:57:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:20,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 23:57:20,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 23:57:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-09 23:57:20,001 INFO L87 Difference]: Start difference. First operand 919 states and 1305 transitions. Second operand has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:21,212 INFO L93 Difference]: Finished difference Result 1848 states and 2641 transitions. [2024-11-09 23:57:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 23:57:21,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:21,216 INFO L225 Difference]: With dead ends: 1848 [2024-11-09 23:57:21,216 INFO L226 Difference]: Without dead ends: 1485 [2024-11-09 23:57:21,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=288, Invalid=1272, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 23:57:21,218 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 737 mSDsluCounter, 2270 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:21,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 2497 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:57:21,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-09 23:57:21,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 919. [2024-11-09 23:57:21,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 917 states have (on average 1.4220283533260631) internal successors, (1304), 918 states have internal predecessors, (1304), 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) [2024-11-09 23:57:21,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1304 transitions. [2024-11-09 23:57:21,230 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1304 transitions. Word has length 55 [2024-11-09 23:57:21,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:21,230 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 1304 transitions. [2024-11-09 23:57:21,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.619047619047619) internal successors, (55), 21 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,230 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1304 transitions. [2024-11-09 23:57:21,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:21,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:21,231 INFO L215 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] [2024-11-09 23:57:21,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:57:21,231 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:21,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:21,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1775973940, now seen corresponding path program 1 times [2024-11-09 23:57:21,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:21,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420787843] [2024-11-09 23:57:21,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:21,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:21,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:21,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420787843] [2024-11-09 23:57:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420787843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:21,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:57:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182993873] [2024-11-09 23:57:21,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:21,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:57:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:21,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:57:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:57:21,581 INFO L87 Difference]: Start difference. First operand 919 states and 1304 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:21,956 INFO L93 Difference]: Finished difference Result 2091 states and 3008 transitions. [2024-11-09 23:57:21,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:21,956 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:21,959 INFO L225 Difference]: With dead ends: 2091 [2024-11-09 23:57:21,959 INFO L226 Difference]: Without dead ends: 1707 [2024-11-09 23:57:21,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2024-11-09 23:57:21,961 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 439 mSDsluCounter, 1010 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:21,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1179 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2024-11-09 23:57:21,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 892. [2024-11-09 23:57:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 890 states have (on average 1.4258426966292135) internal successors, (1269), 891 states have internal predecessors, (1269), 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) [2024-11-09 23:57:21,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1269 transitions. [2024-11-09 23:57:21,973 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1269 transitions. Word has length 55 [2024-11-09 23:57:21,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:21,974 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1269 transitions. [2024-11-09 23:57:21,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,974 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1269 transitions. [2024-11-09 23:57:21,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 23:57:21,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:21,974 INFO L215 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] [2024-11-09 23:57:21,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:57:21,974 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:21,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2139533340, now seen corresponding path program 1 times [2024-11-09 23:57:21,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:21,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131625348] [2024-11-09 23:57:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:21,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131625348] [2024-11-09 23:57:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131625348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 23:57:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093080966] [2024-11-09 23:57:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:22,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 23:57:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:22,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 23:57:22,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:22,392 INFO L87 Difference]: Start difference. First operand 892 states and 1269 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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) [2024-11-09 23:57:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:22,758 INFO L93 Difference]: Finished difference Result 1246 states and 1788 transitions. [2024-11-09 23:57:22,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:57:22,758 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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 56 [2024-11-09 23:57:22,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:22,760 INFO L225 Difference]: With dead ends: 1246 [2024-11-09 23:57:22,760 INFO L226 Difference]: Without dead ends: 867 [2024-11-09 23:57:22,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:57:22,761 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 304 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:22,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 780 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:22,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-11-09 23:57:22,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 867. [2024-11-09 23:57:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 867 states, 866 states have (on average 1.4318706697459584) internal successors, (1240), 866 states have internal predecessors, (1240), 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) [2024-11-09 23:57:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1240 transitions. [2024-11-09 23:57:22,770 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1240 transitions. Word has length 56 [2024-11-09 23:57:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:22,771 INFO L471 AbstractCegarLoop]: Abstraction has 867 states and 1240 transitions. [2024-11-09 23:57:22,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 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) [2024-11-09 23:57:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1240 transitions. [2024-11-09 23:57:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:57:22,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:22,771 INFO L215 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] [2024-11-09 23:57:22,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:57:22,772 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:22,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1862190248, now seen corresponding path program 1 times [2024-11-09 23:57:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861016674] [2024-11-09 23:57:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:22,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:22,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:22,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861016674] [2024-11-09 23:57:22,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861016674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:22,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:22,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290779983] [2024-11-09 23:57:22,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:22,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:22,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:22,858 INFO L87 Difference]: Start difference. First operand 867 states and 1240 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 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) [2024-11-09 23:57:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,035 INFO L93 Difference]: Finished difference Result 3175 states and 4644 transitions. [2024-11-09 23:57:23,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:57:23,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 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 [2024-11-09 23:57:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,040 INFO L225 Difference]: With dead ends: 3175 [2024-11-09 23:57:23,040 INFO L226 Difference]: Without dead ends: 2381 [2024-11-09 23:57:23,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:23,042 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 526 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 304 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2381 states. [2024-11-09 23:57:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2381 to 1839. [2024-11-09 23:57:23,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1839 states, 1838 states have (on average 1.4434167573449401) internal successors, (2653), 1838 states have internal predecessors, (2653), 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) [2024-11-09 23:57:23,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1839 states to 1839 states and 2653 transitions. [2024-11-09 23:57:23,063 INFO L78 Accepts]: Start accepts. Automaton has 1839 states and 2653 transitions. Word has length 77 [2024-11-09 23:57:23,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,063 INFO L471 AbstractCegarLoop]: Abstraction has 1839 states and 2653 transitions. [2024-11-09 23:57:23,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 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) [2024-11-09 23:57:23,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1839 states and 2653 transitions. [2024-11-09 23:57:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 23:57:23,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,064 INFO L215 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] [2024-11-09 23:57:23,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:57:23,064 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:23,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,065 INFO L85 PathProgramCache]: Analyzing trace with hash 414622567, now seen corresponding path program 1 times [2024-11-09 23:57:23,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078202692] [2024-11-09 23:57:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:23,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078202692] [2024-11-09 23:57:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078202692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:23,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:23,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709830798] [2024-11-09 23:57:23,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:23,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:23,153 INFO L87 Difference]: Start difference. First operand 1839 states and 2653 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,303 INFO L93 Difference]: Finished difference Result 6091 states and 8883 transitions. [2024-11-09 23:57:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:57:23,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 23:57:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,311 INFO L225 Difference]: With dead ends: 6091 [2024-11-09 23:57:23,312 INFO L226 Difference]: Without dead ends: 4325 [2024-11-09 23:57:23,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:23,314 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 642 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 233 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4325 states. [2024-11-09 23:57:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4325 to 3963. [2024-11-09 23:57:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3963 states, 3962 states have (on average 1.4464916708732962) internal successors, (5731), 3962 states have internal predecessors, (5731), 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) [2024-11-09 23:57:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3963 states to 3963 states and 5731 transitions. [2024-11-09 23:57:23,352 INFO L78 Accepts]: Start accepts. Automaton has 3963 states and 5731 transitions. Word has length 78 [2024-11-09 23:57:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,353 INFO L471 AbstractCegarLoop]: Abstraction has 3963 states and 5731 transitions. [2024-11-09 23:57:23,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 3963 states and 5731 transitions. [2024-11-09 23:57:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 23:57:23,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,354 INFO L215 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] [2024-11-09 23:57:23,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:57:23,354 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:23,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,354 INFO L85 PathProgramCache]: Analyzing trace with hash -165866386, now seen corresponding path program 1 times [2024-11-09 23:57:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507315378] [2024-11-09 23:57:23,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:23,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:23,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:23,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507315378] [2024-11-09 23:57:23,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507315378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:23,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:23,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:23,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045551883] [2024-11-09 23:57:23,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:23,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:23,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:23,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:23,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:23,414 INFO L87 Difference]: Start difference. First operand 3963 states and 5731 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,443 INFO L93 Difference]: Finished difference Result 10059 states and 14497 transitions. [2024-11-09 23:57:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:23,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 23:57:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,458 INFO L225 Difference]: With dead ends: 10059 [2024-11-09 23:57:23,458 INFO L226 Difference]: Without dead ends: 6169 [2024-11-09 23:57:23,462 INFO L431 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 [2024-11-09 23:57:23,463 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 74 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 197 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:23,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2024-11-09 23:57:23,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6095. [2024-11-09 23:57:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 6094 states have (on average 1.4149983590416804) internal successors, (8623), 6094 states have internal predecessors, (8623), 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) [2024-11-09 23:57:23,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 8623 transitions. [2024-11-09 23:57:23,520 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 8623 transitions. Word has length 78 [2024-11-09 23:57:23,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,520 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 8623 transitions. [2024-11-09 23:57:23,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 8623 transitions. [2024-11-09 23:57:23,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:57:23,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,521 INFO L215 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] [2024-11-09 23:57:23,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:57:23,521 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:23,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2003585772, now seen corresponding path program 1 times [2024-11-09 23:57:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730115247] [2024-11-09 23:57:23,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:23,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:23,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730115247] [2024-11-09 23:57:23,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730115247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:23,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:23,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:23,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451850766] [2024-11-09 23:57:23,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:23,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:23,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:23,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:23,575 INFO L87 Difference]: Start difference. First operand 6095 states and 8623 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) [2024-11-09 23:57:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,603 INFO L93 Difference]: Finished difference Result 11471 states and 16197 transitions. [2024-11-09 23:57:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:23,604 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 [2024-11-09 23:57:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,610 INFO L225 Difference]: With dead ends: 11471 [2024-11-09 23:57:23,611 INFO L226 Difference]: Without dead ends: 5449 [2024-11-09 23:57:23,615 INFO L431 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 [2024-11-09 23:57:23,615 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 55 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 265 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5449 states. [2024-11-09 23:57:23,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5449 to 4365. [2024-11-09 23:57:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4365 states, 4364 states have (on average 1.3856553620531622) internal successors, (6047), 4364 states have internal predecessors, (6047), 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) [2024-11-09 23:57:23,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4365 states to 4365 states and 6047 transitions. [2024-11-09 23:57:23,706 INFO L78 Accepts]: Start accepts. Automaton has 4365 states and 6047 transitions. Word has length 79 [2024-11-09 23:57:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,707 INFO L471 AbstractCegarLoop]: Abstraction has 4365 states and 6047 transitions. [2024-11-09 23:57:23,707 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) [2024-11-09 23:57:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 4365 states and 6047 transitions. [2024-11-09 23:57:23,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:57:23,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,707 INFO L215 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] [2024-11-09 23:57:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:57:23,708 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:23,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1883686277, now seen corresponding path program 1 times [2024-11-09 23:57:23,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39272851] [2024-11-09 23:57:23,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39272851] [2024-11-09 23:57:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39272851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:23,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:23,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450915289] [2024-11-09 23:57:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:23,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:23,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:23,769 INFO L87 Difference]: Start difference. First operand 4365 states and 6047 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,791 INFO L93 Difference]: Finished difference Result 12427 states and 17139 transitions. [2024-11-09 23:57:23,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:23,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 23:57:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,806 INFO L225 Difference]: With dead ends: 12427 [2024-11-09 23:57:23,807 INFO L226 Difference]: Without dead ends: 8135 [2024-11-09 23:57:23,811 INFO L431 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 [2024-11-09 23:57:23,811 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 266 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8135 states. [2024-11-09 23:57:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8135 to 7449. [2024-11-09 23:57:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7449 states, 7448 states have (on average 1.3690923737916219) internal successors, (10197), 7448 states have internal predecessors, (10197), 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) [2024-11-09 23:57:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7449 states to 7449 states and 10197 transitions. [2024-11-09 23:57:23,876 INFO L78 Accepts]: Start accepts. Automaton has 7449 states and 10197 transitions. Word has length 80 [2024-11-09 23:57:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,876 INFO L471 AbstractCegarLoop]: Abstraction has 7449 states and 10197 transitions. [2024-11-09 23:57:23,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,877 INFO L276 IsEmpty]: Start isEmpty. Operand 7449 states and 10197 transitions. [2024-11-09 23:57:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:57:23,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,877 INFO L215 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, 1] [2024-11-09 23:57:23,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:57:23,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:23,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,878 INFO L85 PathProgramCache]: Analyzing trace with hash 120019334, now seen corresponding path program 1 times [2024-11-09 23:57:23,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901642970] [2024-11-09 23:57:23,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:24,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:24,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:24,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901642970] [2024-11-09 23:57:24,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901642970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:24,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:24,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:24,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044498721] [2024-11-09 23:57:24,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:24,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:57:24,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:24,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:57:24,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:57:24,104 INFO L87 Difference]: Start difference. First operand 7449 states and 10197 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:24,137 INFO L93 Difference]: Finished difference Result 7883 states and 10726 transitions. [2024-11-09 23:57:24,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:57:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 23:57:24,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:24,145 INFO L225 Difference]: With dead ends: 7883 [2024-11-09 23:57:24,145 INFO L226 Difference]: Without dead ends: 7881 [2024-11-09 23:57:24,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:57:24,147 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:24,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 609 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2024-11-09 23:57:24,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7881. [2024-11-09 23:57:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 7880 states have (on average 1.341243654822335) internal successors, (10569), 7880 states have internal predecessors, (10569), 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) [2024-11-09 23:57:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 10569 transitions. [2024-11-09 23:57:24,218 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 10569 transitions. Word has length 81 [2024-11-09 23:57:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:24,218 INFO L471 AbstractCegarLoop]: Abstraction has 7881 states and 10569 transitions. [2024-11-09 23:57:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 10569 transitions. [2024-11-09 23:57:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:57:24,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:24,219 INFO L215 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, 1] [2024-11-09 23:57:24,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:57:24,220 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1038086423, now seen corresponding path program 1 times [2024-11-09 23:57:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756670680] [2024-11-09 23:57:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:24,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:24,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:24,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756670680] [2024-11-09 23:57:24,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756670680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:24,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:24,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:24,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146587396] [2024-11-09 23:57:24,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:24,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:24,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:24,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:24,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:24,300 INFO L87 Difference]: Start difference. First operand 7881 states and 10569 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:24,468 INFO L93 Difference]: Finished difference Result 16303 states and 21889 transitions. [2024-11-09 23:57:24,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:57:24,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 23:57:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:24,478 INFO L225 Difference]: With dead ends: 16303 [2024-11-09 23:57:24,478 INFO L226 Difference]: Without dead ends: 8495 [2024-11-09 23:57:24,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:57:24,484 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 504 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:24,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 266 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8495 states. [2024-11-09 23:57:24,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8495 to 7827. [2024-11-09 23:57:24,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7827 states, 7826 states have (on average 1.3297981088678763) internal successors, (10407), 7826 states have internal predecessors, (10407), 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) [2024-11-09 23:57:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7827 states to 7827 states and 10407 transitions. [2024-11-09 23:57:24,546 INFO L78 Accepts]: Start accepts. Automaton has 7827 states and 10407 transitions. Word has length 81 [2024-11-09 23:57:24,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:24,546 INFO L471 AbstractCegarLoop]: Abstraction has 7827 states and 10407 transitions. [2024-11-09 23:57:24,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,546 INFO L276 IsEmpty]: Start isEmpty. Operand 7827 states and 10407 transitions. [2024-11-09 23:57:24,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 23:57:24,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:24,547 INFO L215 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, 1, 1] [2024-11-09 23:57:24,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:57:24,547 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:24,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:24,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1471297767, now seen corresponding path program 1 times [2024-11-09 23:57:24,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:24,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211035278] [2024-11-09 23:57:24,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:24,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211035278] [2024-11-09 23:57:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211035278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:24,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:24,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333482149] [2024-11-09 23:57:24,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:24,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:24,604 INFO L87 Difference]: Start difference. First operand 7827 states and 10407 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-11-09 23:57:24,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:24,635 INFO L93 Difference]: Finished difference Result 16865 states and 22413 transitions. [2024-11-09 23:57:24,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:24,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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 82 [2024-11-09 23:57:24,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:24,646 INFO L225 Difference]: With dead ends: 16865 [2024-11-09 23:57:24,646 INFO L226 Difference]: Without dead ends: 9111 [2024-11-09 23:57:24,652 INFO L431 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 [2024-11-09 23:57:24,653 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 59 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:24,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9111 states. [2024-11-09 23:57:24,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9111 to 8821. [2024-11-09 23:57:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8821 states, 8820 states have (on average 1.3087301587301587) internal successors, (11543), 8820 states have internal predecessors, (11543), 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) [2024-11-09 23:57:24,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 11543 transitions. [2024-11-09 23:57:24,719 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 11543 transitions. Word has length 82 [2024-11-09 23:57:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:24,720 INFO L471 AbstractCegarLoop]: Abstraction has 8821 states and 11543 transitions. [2024-11-09 23:57:24,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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) [2024-11-09 23:57:24,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 11543 transitions. [2024-11-09 23:57:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:57:24,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:24,721 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:24,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:57:24,722 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:24,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:24,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1937800094, now seen corresponding path program 1 times [2024-11-09 23:57:24,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:24,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681231560] [2024-11-09 23:57:24,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:24,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:24,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:24,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681231560] [2024-11-09 23:57:24,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681231560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:24,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:24,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680745143] [2024-11-09 23:57:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:24,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:24,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:24,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:24,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:24,795 INFO L87 Difference]: Start difference. First operand 8821 states and 11543 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:24,826 INFO L93 Difference]: Finished difference Result 16923 states and 21965 transitions. [2024-11-09 23:57:24,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:24,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-09 23:57:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:24,834 INFO L225 Difference]: With dead ends: 16923 [2024-11-09 23:57:24,834 INFO L226 Difference]: Without dead ends: 8175 [2024-11-09 23:57:24,840 INFO L431 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 [2024-11-09 23:57:24,840 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 55 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 239 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 [2024-11-09 23:57:24,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 239 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8175 states. [2024-11-09 23:57:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8175 to 8173. [2024-11-09 23:57:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8173 states, 8172 states have (on average 1.267131669114048) internal successors, (10355), 8172 states have internal predecessors, (10355), 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) [2024-11-09 23:57:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8173 states to 8173 states and 10355 transitions. [2024-11-09 23:57:24,894 INFO L78 Accepts]: Start accepts. Automaton has 8173 states and 10355 transitions. Word has length 103 [2024-11-09 23:57:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:24,895 INFO L471 AbstractCegarLoop]: Abstraction has 8173 states and 10355 transitions. [2024-11-09 23:57:24,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8173 states and 10355 transitions. [2024-11-09 23:57:24,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:57:24,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:24,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:24,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 23:57:24,896 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:57:24,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:24,897 INFO L85 PathProgramCache]: Analyzing trace with hash -4532276, now seen corresponding path program 1 times [2024-11-09 23:57:24,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:24,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216450195] [2024-11-09 23:57:24,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:24,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:25,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216450195] [2024-11-09 23:57:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216450195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502425376] [2024-11-09 23:57:25,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:25,234 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) [2024-11-09 23:57:25,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:57:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:25,365 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 23:57:25,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:26,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:26,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502425376] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:28,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 17] total 41 [2024-11-09 23:57:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393621225] [2024-11-09 23:57:28,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:28,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-09 23:57:28,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-09 23:57:28,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1526, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 23:57:28,846 INFO L87 Difference]: Start difference. First operand 8173 states and 10355 transitions. Second operand has 41 states, 41 states have (on average 7.097560975609756) internal successors, (291), 41 states have internal predecessors, (291), 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) [2024-11-09 23:58:08,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:08,002 INFO L93 Difference]: Finished difference Result 75648 states and 96532 transitions. [2024-11-09 23:58:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 268 states. [2024-11-09 23:58:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 7.097560975609756) internal successors, (291), 41 states have internal predecessors, (291), 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 104 [2024-11-09 23:58:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:08,089 INFO L225 Difference]: With dead ends: 75648 [2024-11-09 23:58:08,089 INFO L226 Difference]: Without dead ends: 67548 [2024-11-09 23:58:08,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35004 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=8184, Invalid=85758, Unknown=0, NotChecked=0, Total=93942 [2024-11-09 23:58:08,115 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 7926 mSDsluCounter, 4757 mSDsCounter, 0 mSdLazyCounter, 7789 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7926 SdHoareTripleChecker+Valid, 4964 SdHoareTripleChecker+Invalid, 7981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 7789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:08,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7926 Valid, 4964 Invalid, 7981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 7789 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-09 23:58:08,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67548 states. [2024-11-09 23:58:08,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67548 to 46790. [2024-11-09 23:58:08,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46790 states, 46789 states have (on average 1.270512299899549) internal successors, (59446), 46789 states have internal predecessors, (59446), 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) [2024-11-09 23:58:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46790 states to 46790 states and 59446 transitions. [2024-11-09 23:58:08,627 INFO L78 Accepts]: Start accepts. Automaton has 46790 states and 59446 transitions. Word has length 104 [2024-11-09 23:58:08,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:08,628 INFO L471 AbstractCegarLoop]: Abstraction has 46790 states and 59446 transitions. [2024-11-09 23:58:08,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 7.097560975609756) internal successors, (291), 41 states have internal predecessors, (291), 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) [2024-11-09 23:58:08,628 INFO L276 IsEmpty]: Start isEmpty. Operand 46790 states and 59446 transitions. [2024-11-09 23:58:08,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:58:08,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:08,636 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:08,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:58:08,837 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,SelfDestructingSolverStorable24 [2024-11-09 23:58:08,837 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:08,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:08,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1719313918, now seen corresponding path program 1 times [2024-11-09 23:58:08,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:08,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002260161] [2024-11-09 23:58:08,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:08,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:08,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:08,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002260161] [2024-11-09 23:58:08,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002260161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:08,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:08,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:08,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433598217] [2024-11-09 23:58:08,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:08,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:08,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:08,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:08,909 INFO L87 Difference]: Start difference. First operand 46790 states and 59446 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2024-11-09 23:58:09,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:09,017 INFO L93 Difference]: Finished difference Result 71059 states and 89795 transitions. [2024-11-09 23:58:09,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:09,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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 105 [2024-11-09 23:58:09,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:09,047 INFO L225 Difference]: With dead ends: 71059 [2024-11-09 23:58:09,047 INFO L226 Difference]: Without dead ends: 24364 [2024-11-09 23:58:09,074 INFO L431 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 [2024-11-09 23:58:09,075 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 48 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 222 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 [2024-11-09 23:58:09,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 222 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:09,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24364 states. [2024-11-09 23:58:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24364 to 23307. [2024-11-09 23:58:09,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23307 states, 23306 states have (on average 1.2353471209130695) internal successors, (28791), 23306 states have internal predecessors, (28791), 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) [2024-11-09 23:58:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 28791 transitions. [2024-11-09 23:58:09,445 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 28791 transitions. Word has length 105 [2024-11-09 23:58:09,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:09,445 INFO L471 AbstractCegarLoop]: Abstraction has 23307 states and 28791 transitions. [2024-11-09 23:58:09,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 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) [2024-11-09 23:58:09,445 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 28791 transitions. [2024-11-09 23:58:09,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:58:09,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:09,448 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:09,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 23:58:09,448 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:09,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:09,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1410673567, now seen corresponding path program 1 times [2024-11-09 23:58:09,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:09,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018798357] [2024-11-09 23:58:09,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:09,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018798357] [2024-11-09 23:58:10,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018798357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:10,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464939771] [2024-11-09 23:58:10,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:10,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:10,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:10,124 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) [2024-11-09 23:58:10,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:58:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:10,229 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 23:58:10,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:10,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:12,796 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464939771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:12,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 51 [2024-11-09 23:58:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365808292] [2024-11-09 23:58:12,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-09 23:58:12,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:12,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-09 23:58:12,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2378, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 23:58:12,801 INFO L87 Difference]: Start difference. First operand 23307 states and 28791 transitions. Second operand has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 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) [2024-11-09 23:58:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:16,359 INFO L93 Difference]: Finished difference Result 88127 states and 109153 transitions. [2024-11-09 23:58:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-09 23:58:16,359 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 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 105 [2024-11-09 23:58:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:16,420 INFO L225 Difference]: With dead ends: 88127 [2024-11-09 23:58:16,420 INFO L226 Difference]: Without dead ends: 64909 [2024-11-09 23:58:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1167, Invalid=9135, Unknown=0, NotChecked=0, Total=10302 [2024-11-09 23:58:16,446 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 2851 mSDsluCounter, 7900 mSDsCounter, 0 mSdLazyCounter, 3740 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 8166 SdHoareTripleChecker+Invalid, 3764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:16,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 8166 Invalid, 3764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3740 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:58:16,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2024-11-09 23:58:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 55836. [2024-11-09 23:58:16,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55836 states, 55835 states have (on average 1.2416942777827527) internal successors, (69330), 55835 states have internal predecessors, (69330), 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) [2024-11-09 23:58:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55836 states to 55836 states and 69330 transitions. [2024-11-09 23:58:16,935 INFO L78 Accepts]: Start accepts. Automaton has 55836 states and 69330 transitions. Word has length 105 [2024-11-09 23:58:16,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:16,935 INFO L471 AbstractCegarLoop]: Abstraction has 55836 states and 69330 transitions. [2024-11-09 23:58:16,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 5.803921568627451) internal successors, (296), 51 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) [2024-11-09 23:58:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 55836 states and 69330 transitions. [2024-11-09 23:58:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:58:16,941 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:16,941 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:16,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:58:17,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 23:58:17,144 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:17,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:17,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2026527704, now seen corresponding path program 1 times [2024-11-09 23:58:17,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:17,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052029274] [2024-11-09 23:58:17,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:17,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052029274] [2024-11-09 23:58:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052029274] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363355118] [2024-11-09 23:58:17,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:17,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:17,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:17,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:17,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:58:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:17,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-09 23:58:17,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:18,051 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363355118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:18,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:18,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 13] total 29 [2024-11-09 23:58:18,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926881252] [2024-11-09 23:58:18,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:18,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 23:58:18,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:18,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 23:58:18,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-11-09 23:58:18,749 INFO L87 Difference]: Start difference. First operand 55836 states and 69330 transitions. Second operand has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 29 states have internal predecessors, (268), 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) [2024-11-09 23:58:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:20,446 INFO L93 Difference]: Finished difference Result 97651 states and 120938 transitions. [2024-11-09 23:58:20,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-09 23:58:20,446 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 29 states have internal predecessors, (268), 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 105 [2024-11-09 23:58:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:20,518 INFO L225 Difference]: With dead ends: 97651 [2024-11-09 23:58:20,518 INFO L226 Difference]: Without dead ends: 80877 [2024-11-09 23:58:20,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1120, Invalid=3850, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 23:58:20,546 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 2167 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2167 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:20,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2167 Valid, 1680 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 23:58:20,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80877 states. [2024-11-09 23:58:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80877 to 46188. [2024-11-09 23:58:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46188 states, 46187 states have (on average 1.2395046225128283) internal successors, (57249), 46187 states have internal predecessors, (57249), 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) [2024-11-09 23:58:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46188 states to 46188 states and 57249 transitions. [2024-11-09 23:58:21,069 INFO L78 Accepts]: Start accepts. Automaton has 46188 states and 57249 transitions. Word has length 105 [2024-11-09 23:58:21,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:21,069 INFO L471 AbstractCegarLoop]: Abstraction has 46188 states and 57249 transitions. [2024-11-09 23:58:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 8.933333333333334) internal successors, (268), 29 states have internal predecessors, (268), 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) [2024-11-09 23:58:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 46188 states and 57249 transitions. [2024-11-09 23:58:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:58:21,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:21,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:21,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:58:21,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:21,275 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:21,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash -118014310, now seen corresponding path program 1 times [2024-11-09 23:58:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:21,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884212625] [2024-11-09 23:58:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 23:58:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884212625] [2024-11-09 23:58:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884212625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732457525] [2024-11-09 23:58:21,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:21,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:21,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:21,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:21,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:21,309 INFO L87 Difference]: Start difference. First operand 46188 states and 57249 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2024-11-09 23:58:21,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:21,449 INFO L93 Difference]: Finished difference Result 79312 states and 98226 transitions. [2024-11-09 23:58:21,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:21,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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 106 [2024-11-09 23:58:21,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:21,479 INFO L225 Difference]: With dead ends: 79312 [2024-11-09 23:58:21,479 INFO L226 Difference]: Without dead ends: 33225 [2024-11-09 23:58:21,502 INFO L431 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 [2024-11-09 23:58:21,503 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 86 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:21,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 121 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:21,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33225 states. [2024-11-09 23:58:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33225 to 33225. [2024-11-09 23:58:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33225 states, 33224 states have (on average 1.2151456778232603) internal successors, (40372), 33224 states have internal predecessors, (40372), 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) [2024-11-09 23:58:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33225 states to 33225 states and 40372 transitions. [2024-11-09 23:58:21,746 INFO L78 Accepts]: Start accepts. Automaton has 33225 states and 40372 transitions. Word has length 106 [2024-11-09 23:58:21,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:21,746 INFO L471 AbstractCegarLoop]: Abstraction has 33225 states and 40372 transitions. [2024-11-09 23:58:21,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 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) [2024-11-09 23:58:21,746 INFO L276 IsEmpty]: Start isEmpty. Operand 33225 states and 40372 transitions. [2024-11-09 23:58:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:58:21,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:21,750 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:21,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 23:58:21,750 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:21,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:21,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1115797679, now seen corresponding path program 1 times [2024-11-09 23:58:21,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:21,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082083266] [2024-11-09 23:58:21,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:21,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082083266] [2024-11-09 23:58:21,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082083266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:21,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:21,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214719848] [2024-11-09 23:58:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:21,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:21,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:21,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:21,864 INFO L87 Difference]: Start difference. First operand 33225 states and 40372 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2024-11-09 23:58:21,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:21,959 INFO L93 Difference]: Finished difference Result 50777 states and 61802 transitions. [2024-11-09 23:58:21,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:21,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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 106 [2024-11-09 23:58:21,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:21,976 INFO L225 Difference]: With dead ends: 50777 [2024-11-09 23:58:21,976 INFO L226 Difference]: Without dead ends: 17653 [2024-11-09 23:58:21,994 INFO L431 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 [2024-11-09 23:58:21,995 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 45 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 203 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 [2024-11-09 23:58:21,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 203 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17653 states. [2024-11-09 23:58:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17653 to 17651. [2024-11-09 23:58:22,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17651 states, 17650 states have (on average 1.2057790368271954) internal successors, (21282), 17650 states have internal predecessors, (21282), 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) [2024-11-09 23:58:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17651 states to 17651 states and 21282 transitions. [2024-11-09 23:58:22,182 INFO L78 Accepts]: Start accepts. Automaton has 17651 states and 21282 transitions. Word has length 106 [2024-11-09 23:58:22,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:22,183 INFO L471 AbstractCegarLoop]: Abstraction has 17651 states and 21282 transitions. [2024-11-09 23:58:22,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 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) [2024-11-09 23:58:22,183 INFO L276 IsEmpty]: Start isEmpty. Operand 17651 states and 21282 transitions. [2024-11-09 23:58:22,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:58:22,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:22,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:22,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 23:58:22,186 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:22,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:22,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1850265007, now seen corresponding path program 1 times [2024-11-09 23:58:22,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607236784] [2024-11-09 23:58:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:22,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607236784] [2024-11-09 23:58:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607236784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253363053] [2024-11-09 23:58:23,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:23,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:23,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:23,186 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:23,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:58:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:23,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 23:58:23,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:24,035 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:25,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253363053] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:25,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:25,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 16] total 54 [2024-11-09 23:58:25,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176169366] [2024-11-09 23:58:25,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:25,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2024-11-09 23:58:25,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2024-11-09 23:58:25,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=2677, Unknown=0, NotChecked=0, Total=2862 [2024-11-09 23:58:25,165 INFO L87 Difference]: Start difference. First operand 17651 states and 21282 transitions. Second operand has 54 states, 54 states have (on average 5.2592592592592595) internal successors, (284), 54 states have internal predecessors, (284), 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) [2024-11-09 23:58:30,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:30,829 INFO L93 Difference]: Finished difference Result 83261 states and 101186 transitions. [2024-11-09 23:58:30,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-11-09 23:58:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.2592592592592595) internal successors, (284), 54 states have internal predecessors, (284), 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 106 [2024-11-09 23:58:30,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:30,895 INFO L225 Difference]: With dead ends: 83261 [2024-11-09 23:58:30,895 INFO L226 Difference]: Without dead ends: 72970 [2024-11-09 23:58:30,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4237 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1848, Invalid=16242, Unknown=0, NotChecked=0, Total=18090 [2024-11-09 23:58:30,918 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 2643 mSDsluCounter, 5544 mSDsCounter, 0 mSdLazyCounter, 3064 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2643 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 3116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 3064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:30,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2643 Valid, 5720 Invalid, 3116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 3064 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:58:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72970 states. [2024-11-09 23:58:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72970 to 53063. [2024-11-09 23:58:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53063 states, 53062 states have (on average 1.2057781463194) internal successors, (63981), 53062 states have internal predecessors, (63981), 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) [2024-11-09 23:58:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53063 states to 53063 states and 63981 transitions. [2024-11-09 23:58:31,369 INFO L78 Accepts]: Start accepts. Automaton has 53063 states and 63981 transitions. Word has length 106 [2024-11-09 23:58:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:31,369 INFO L471 AbstractCegarLoop]: Abstraction has 53063 states and 63981 transitions. [2024-11-09 23:58:31,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.2592592592592595) internal successors, (284), 54 states have internal predecessors, (284), 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) [2024-11-09 23:58:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 53063 states and 63981 transitions. [2024-11-09 23:58:31,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:58:31,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:31,372 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:31,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:58:31,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:31,573 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:58:31,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:31,573 INFO L85 PathProgramCache]: Analyzing trace with hash 602216087, now seen corresponding path program 1 times [2024-11-09 23:58:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106840403] [2024-11-09 23:58:31,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:31,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:32,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106840403] [2024-11-09 23:58:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106840403] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:58:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902095009] [2024-11-09 23:58:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:32,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:58:32,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:58:32,234 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:58:32,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:58:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:32,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-09 23:58:32,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:58:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:34,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:58:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902095009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:58:36,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:58:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 63 [2024-11-09 23:58:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257389498] [2024-11-09 23:58:36,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:58:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-09 23:58:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:36,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-09 23:58:36,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3641, Unknown=0, NotChecked=0, Total=3906 [2024-11-09 23:58:36,137 INFO L87 Difference]: Start difference. First operand 53063 states and 63981 transitions. Second operand has 63 states, 63 states have (on average 4.634920634920635) internal successors, (292), 63 states have internal predecessors, (292), 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)