./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16db63adfa8747ce86c67ae78be78e889eae71e4b07fbcb21a84ad0decbbdac7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 08:29:48,792 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 08:29:48,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 08:29:48,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 08:29:48,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 08:29:48,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 08:29:48,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 08:29:48,881 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 08:29:48,881 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 08:29:48,883 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 08:29:48,884 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 08:29:48,884 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 08:29:48,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 08:29:48,885 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 08:29:48,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 08:29:48,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 08:29:48,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 08:29:48,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 08:29:48,887 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 08:29:48,887 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 08:29:48,887 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 08:29:48,888 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 08:29:48,888 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 08:29:48,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 08:29:48,889 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 08:29:48,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 08:29:48,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 08:29:48,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 08:29:48,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 08:29:48,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 08:29:48,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 08:29:48,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 08:29:48,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:29:48,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 08:29:48,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 08:29:48,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 08:29:48,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 08:29:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 08:29:48,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 08:29:48,892 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 08:29:48,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 08:29:48,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 08:29:48,893 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 -> 16db63adfa8747ce86c67ae78be78e889eae71e4b07fbcb21a84ad0decbbdac7 [2024-11-16 08:29:49,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 08:29:49,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 08:29:49,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 08:29:49,108 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 08:29:49,108 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 08:29:49,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-16 08:29:50,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 08:29:50,512 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 08:29:50,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-16 08:29:50,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03858d38/82e085a5b2ad49ab9ba0e47672e2590a/FLAG5de415f17 [2024-11-16 08:29:50,857 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f03858d38/82e085a5b2ad49ab9ba0e47672e2590a [2024-11-16 08:29:50,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 08:29:50,860 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 08:29:50,861 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 08:29:50,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 08:29:50,868 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 08:29:50,868 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:29:50" (1/1) ... [2024-11-16 08:29:50,869 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@105f0e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:50, skipping insertion in model container [2024-11-16 08:29:50,869 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 08:29:50" (1/1) ... [2024-11-16 08:29:50,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 08:29:51,126 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_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-16 08:29:51,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:29:51,254 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 08:29:51,309 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_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c[12986,12999] [2024-11-16 08:29:51,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 08:29:51,358 INFO L204 MainTranslator]: Completed translation [2024-11-16 08:29:51,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51 WrapperNode [2024-11-16 08:29:51,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 08:29:51,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 08:29:51,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 08:29:51,360 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 08:29:51,365 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,425 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1367 [2024-11-16 08:29:51,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 08:29:51,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 08:29:51,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 08:29:51,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 08:29:51,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,464 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-16 08:29:51,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,477 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 08:29:51,489 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 08:29:51,489 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 08:29:51,489 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 08:29:51,490 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (1/1) ... [2024-11-16 08:29:51,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 08:29:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 08:29:51,531 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-16 08:29:51,533 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-16 08:29:51,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 08:29:51,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 08:29:51,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 08:29:51,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 08:29:51,708 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 08:29:51,709 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 08:29:52,565 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1291: havoc main_~node1____CPAchecker_TMP_2~0#1;havoc main_~node1____CPAchecker_TMP_1~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1; [2024-11-16 08:29:52,566 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1003: havoc main_~node3____CPAchecker_TMP_2~0#1;havoc main_~node3____CPAchecker_TMP_1~0#1;havoc main_~node3____CPAchecker_TMP_0~0#1; [2024-11-16 08:29:52,566 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1147: havoc main_~node2____CPAchecker_TMP_2~0#1;havoc main_~node2____CPAchecker_TMP_1~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1; [2024-11-16 08:29:52,566 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L686: havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-16 08:29:52,566 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L158: havoc main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r141~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r241~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r341~0#1, main_~init__r411~0#1, main_~init__r421~0#1, main_~init__r431~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r142~0#1, main_~init__tmp___1~0#1, main_~init__r212~0#1, main_~init__tmp___2~0#1, main_~init__r232~0#1, main_~init__tmp___3~0#1, main_~init__r242~0#1, main_~init__tmp___4~0#1, main_~init__r312~0#1, main_~init__tmp___5~0#1, main_~init__r322~0#1, main_~init__tmp___6~0#1, main_~init__r342~0#1, main_~init__tmp___7~0#1, main_~init__r412~0#1, main_~init__tmp___8~0#1, main_~init__r422~0#1, main_~init__tmp___9~0#1, main_~init__r432~0#1, main_~init__tmp___10~0#1, main_~init__r123~0#1, main_~init__tmp___11~0#1, main_~init__r133~0#1, main_~init__tmp___12~0#1, main_~init__r143~0#1, main_~init__tmp___13~0#1, main_~init__r213~0#1, main_~init__tmp___14~0#1, main_~init__r233~0#1, main_~init__tmp___15~0#1, main_~init__r243~0#1, main_~init__tmp___16~0#1, main_~init__r313~0#1, main_~init__tmp___17~0#1, main_~init__r323~0#1, main_~init__tmp___18~0#1, main_~init__r343~0#1, main_~init__tmp___19~0#1, main_~init__r413~0#1, main_~init__tmp___20~0#1, main_~init__r423~0#1, main_~init__tmp___21~0#1, main_~init__r433~0#1, main_~init__tmp___22~0#1, main_~init__tmp___23~0#1; [2024-11-16 08:29:52,566 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L859: havoc main_~node4____CPAchecker_TMP_2~0#1;havoc main_~node4____CPAchecker_TMP_1~0#1;havoc main_~node4____CPAchecker_TMP_0~0#1; [2024-11-16 08:29:52,664 INFO L? ?]: Removed 119 outVars from TransFormulas that were not future-live. [2024-11-16 08:29:52,664 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 08:29:52,682 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 08:29:52,683 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 08:29:52,683 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:29:52 BoogieIcfgContainer [2024-11-16 08:29:52,683 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 08:29:52,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 08:29:52,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 08:29:52,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 08:29:52,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 08:29:50" (1/3) ... [2024-11-16 08:29:52,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fb7148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:29:52, skipping insertion in model container [2024-11-16 08:29:52,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 08:29:51" (2/3) ... [2024-11-16 08:29:52,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63fb7148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 08:29:52, skipping insertion in model container [2024-11-16 08:29:52,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 08:29:52" (3/3) ... [2024-11-16 08:29:52,690 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2024-11-16 08:29:52,702 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 08:29:52,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 08:29:52,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 08:29:52,775 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;@5624f2b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 08:29:52,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 08:29:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand has 410 states, 408 states have (on average 1.6323529411764706) internal successors, (666), 409 states have internal predecessors, (666), 0 states have call successors, (0), 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-16 08:29:52,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 08:29:52,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:52,796 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:52,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:52,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:52,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1213148937, now seen corresponding path program 1 times [2024-11-16 08:29:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299456642] [2024-11-16 08:29:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:53,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:53,365 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-16 08:29:53,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:53,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299456642] [2024-11-16 08:29:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299456642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:53,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70965916] [2024-11-16 08:29:53,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:53,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:53,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:53,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:53,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:53,397 INFO L87 Difference]: Start difference. First operand has 410 states, 408 states have (on average 1.6323529411764706) internal successors, (666), 409 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-16 08:29:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:53,509 INFO L93 Difference]: Finished difference Result 740 states and 1172 transitions. [2024-11-16 08:29:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:53,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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 114 [2024-11-16 08:29:53,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:53,521 INFO L225 Difference]: With dead ends: 740 [2024-11-16 08:29:53,521 INFO L226 Difference]: Without dead ends: 561 [2024-11-16 08:29:53,524 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-16 08:29:53,526 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 263 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:53,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 1241 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:29:53,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2024-11-16 08:29:53,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2024-11-16 08:29:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 557 states have (on average 1.5242369838420107) internal successors, (849), 557 states have internal predecessors, (849), 0 states have call successors, (0), 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-16 08:29:53,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 849 transitions. [2024-11-16 08:29:53,587 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 849 transitions. Word has length 114 [2024-11-16 08:29:53,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:53,587 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 849 transitions. [2024-11-16 08:29:53,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 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-16 08:29:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 849 transitions. [2024-11-16 08:29:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-16 08:29:53,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:53,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:53,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 08:29:53,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:53,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -153940633, now seen corresponding path program 1 times [2024-11-16 08:29:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:53,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706526484] [2024-11-16 08:29:53,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:53,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:53,817 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-16 08:29:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706526484] [2024-11-16 08:29:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706526484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374881482] [2024-11-16 08:29:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:53,821 INFO L87 Difference]: Start difference. First operand 558 states and 849 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-16 08:29:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:53,877 INFO L93 Difference]: Finished difference Result 1176 states and 1793 transitions. [2024-11-16 08:29:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:53,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-16 08:29:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:53,882 INFO L225 Difference]: With dead ends: 1176 [2024-11-16 08:29:53,883 INFO L226 Difference]: Without dead ends: 855 [2024-11-16 08:29:53,885 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-16 08:29:53,886 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 228 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:53,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1194 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-11-16 08:29:53,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 851. [2024-11-16 08:29:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 851 states, 850 states have (on average 1.5223529411764707) internal successors, (1294), 850 states have internal predecessors, (1294), 0 states have call successors, (0), 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-16 08:29:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1294 transitions. [2024-11-16 08:29:53,912 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1294 transitions. Word has length 119 [2024-11-16 08:29:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:53,914 INFO L471 AbstractCegarLoop]: Abstraction has 851 states and 1294 transitions. [2024-11-16 08:29:53,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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-16 08:29:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1294 transitions. [2024-11-16 08:29:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-16 08:29:53,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:53,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:53,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 08:29:53,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:53,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1961148181, now seen corresponding path program 1 times [2024-11-16 08:29:53,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:53,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829101329] [2024-11-16 08:29:53,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:53,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:54,079 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-16 08:29:54,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:54,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829101329] [2024-11-16 08:29:54,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829101329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:54,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:54,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:54,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133651586] [2024-11-16 08:29:54,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:54,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:54,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:54,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:54,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:54,081 INFO L87 Difference]: Start difference. First operand 851 states and 1294 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:29:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:54,118 INFO L93 Difference]: Finished difference Result 2031 states and 3088 transitions. [2024-11-16 08:29:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:54,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-11-16 08:29:54,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:54,125 INFO L225 Difference]: With dead ends: 2031 [2024-11-16 08:29:54,126 INFO L226 Difference]: Without dead ends: 1417 [2024-11-16 08:29:54,127 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-16 08:29:54,127 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 219 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:54,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1195 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-16 08:29:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1411. [2024-11-16 08:29:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1410 states have (on average 1.5163120567375887) internal successors, (2138), 1410 states have internal predecessors, (2138), 0 states have call successors, (0), 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-16 08:29:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2138 transitions. [2024-11-16 08:29:54,152 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2138 transitions. Word has length 124 [2024-11-16 08:29:54,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:54,152 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2138 transitions. [2024-11-16 08:29:54,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:29:54,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2138 transitions. [2024-11-16 08:29:54,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-16 08:29:54,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:54,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:54,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 08:29:54,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:54,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:54,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1357295291, now seen corresponding path program 1 times [2024-11-16 08:29:54,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947239568] [2024-11-16 08:29:54,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:54,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:54,304 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-16 08:29:54,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:54,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947239568] [2024-11-16 08:29:54,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947239568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:54,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:54,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:54,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794967219] [2024-11-16 08:29:54,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:54,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:54,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:54,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:54,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:54,305 INFO L87 Difference]: Start difference. First operand 1411 states and 2138 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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-16 08:29:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:54,354 INFO L93 Difference]: Finished difference Result 3663 states and 5540 transitions. [2024-11-16 08:29:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:54,355 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-16 08:29:54,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:54,362 INFO L225 Difference]: With dead ends: 3663 [2024-11-16 08:29:54,362 INFO L226 Difference]: Without dead ends: 2489 [2024-11-16 08:29:54,365 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-16 08:29:54,365 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 210 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:54,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 1196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2024-11-16 08:29:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 2479. [2024-11-16 08:29:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2479 states, 2478 states have (on average 1.5068603712671509) internal successors, (3734), 2478 states have internal predecessors, (3734), 0 states have call successors, (0), 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-16 08:29:54,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3734 transitions. [2024-11-16 08:29:54,400 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3734 transitions. Word has length 129 [2024-11-16 08:29:54,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:54,400 INFO L471 AbstractCegarLoop]: Abstraction has 2479 states and 3734 transitions. [2024-11-16 08:29:54,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 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-16 08:29:54,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3734 transitions. [2024-11-16 08:29:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 08:29:54,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:54,402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:54,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 08:29:54,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:54,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:54,403 INFO L85 PathProgramCache]: Analyzing trace with hash -253148365, now seen corresponding path program 1 times [2024-11-16 08:29:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:54,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899370154] [2024-11-16 08:29:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:54,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:54,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-16 08:29:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:54,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899370154] [2024-11-16 08:29:54,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899370154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:29:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333793263] [2024-11-16 08:29:54,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:29:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:29:54,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:29:54,605 INFO L87 Difference]: Start difference. First operand 2479 states and 3734 transitions. Second operand has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:29:54,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:54,908 INFO L93 Difference]: Finished difference Result 12835 states and 19510 transitions. [2024-11-16 08:29:54,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 08:29:54,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-11-16 08:29:54,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:54,935 INFO L225 Difference]: With dead ends: 12835 [2024-11-16 08:29:54,936 INFO L226 Difference]: Without dead ends: 10593 [2024-11-16 08:29:54,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 08:29:54,940 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 2035 mSDsluCounter, 5272 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2035 SdHoareTripleChecker+Valid, 5899 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:54,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2035 Valid, 5899 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 08:29:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10593 states. [2024-11-16 08:29:55,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10593 to 4536. [2024-11-16 08:29:55,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 4535 states have (on average 1.5100330760749725) internal successors, (6848), 4535 states have internal predecessors, (6848), 0 states have call successors, (0), 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-16 08:29:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 6848 transitions. [2024-11-16 08:29:55,054 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 6848 transitions. Word has length 134 [2024-11-16 08:29:55,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:55,054 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 6848 transitions. [2024-11-16 08:29:55,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.333333333333332) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:29:55,055 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 6848 transitions. [2024-11-16 08:29:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 08:29:55,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:55,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:55,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 08:29:55,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:55,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1608761727, now seen corresponding path program 1 times [2024-11-16 08:29:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084990535] [2024-11-16 08:29:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:55,188 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-16 08:29:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:55,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084990535] [2024-11-16 08:29:55,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084990535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:55,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:55,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:29:55,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390100252] [2024-11-16 08:29:55,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:55,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:29:55,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:55,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:29:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:29:55,192 INFO L87 Difference]: Start difference. First operand 4536 states and 6848 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-16 08:29:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:55,317 INFO L93 Difference]: Finished difference Result 13303 states and 20173 transitions. [2024-11-16 08:29:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:29:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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 136 [2024-11-16 08:29:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:55,350 INFO L225 Difference]: With dead ends: 13303 [2024-11-16 08:29:55,350 INFO L226 Difference]: Without dead ends: 9004 [2024-11-16 08:29:55,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:29:55,361 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 749 mSDsluCounter, 1436 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:55,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2060 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:29:55,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9004 states. [2024-11-16 08:29:55,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9004 to 6753. [2024-11-16 08:29:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6753 states, 6752 states have (on average 1.511255924170616) internal successors, (10204), 6752 states have internal predecessors, (10204), 0 states have call successors, (0), 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-16 08:29:55,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6753 states to 6753 states and 10204 transitions. [2024-11-16 08:29:55,502 INFO L78 Accepts]: Start accepts. Automaton has 6753 states and 10204 transitions. Word has length 136 [2024-11-16 08:29:55,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:55,503 INFO L471 AbstractCegarLoop]: Abstraction has 6753 states and 10204 transitions. [2024-11-16 08:29:55,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 0 states have call successors, (0), 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-16 08:29:55,503 INFO L276 IsEmpty]: Start isEmpty. Operand 6753 states and 10204 transitions. [2024-11-16 08:29:55,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:29:55,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:55,505 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:55,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 08:29:55,506 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:55,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:55,506 INFO L85 PathProgramCache]: Analyzing trace with hash -259387547, now seen corresponding path program 1 times [2024-11-16 08:29:55,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:55,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106779858] [2024-11-16 08:29:55,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:55,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:55,589 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-16 08:29:55,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:55,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106779858] [2024-11-16 08:29:55,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106779858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:55,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:55,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:55,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992305288] [2024-11-16 08:29:55,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:55,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:55,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:55,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:55,591 INFO L87 Difference]: Start difference. First operand 6753 states and 10204 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:55,658 INFO L93 Difference]: Finished difference Result 14906 states and 22586 transitions. [2024-11-16 08:29:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:29:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:55,674 INFO L225 Difference]: With dead ends: 14906 [2024-11-16 08:29:55,675 INFO L226 Difference]: Without dead ends: 10326 [2024-11-16 08:29:55,683 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-16 08:29:55,684 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 236 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:55,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1396 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10326 states. [2024-11-16 08:29:55,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10326 to 10324. [2024-11-16 08:29:55,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10324 states, 10323 states have (on average 1.5084762181536375) internal successors, (15572), 10323 states have internal predecessors, (15572), 0 states have call successors, (0), 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-16 08:29:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10324 states to 10324 states and 15572 transitions. [2024-11-16 08:29:55,840 INFO L78 Accepts]: Start accepts. Automaton has 10324 states and 15572 transitions. Word has length 138 [2024-11-16 08:29:55,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:55,840 INFO L471 AbstractCegarLoop]: Abstraction has 10324 states and 15572 transitions. [2024-11-16 08:29:55,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 10324 states and 15572 transitions. [2024-11-16 08:29:55,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:29:55,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:55,842 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:55,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 08:29:55,842 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:55,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash -874551487, now seen corresponding path program 1 times [2024-11-16 08:29:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:55,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777872068] [2024-11-16 08:29:55,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:55,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:55,929 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-16 08:29:55,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:55,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777872068] [2024-11-16 08:29:55,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777872068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:55,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:55,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:55,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025022160] [2024-11-16 08:29:55,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:55,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:55,931 INFO L87 Difference]: Start difference. First operand 10324 states and 15572 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:56,002 INFO L93 Difference]: Finished difference Result 19958 states and 30134 transitions. [2024-11-16 08:29:56,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:56,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:29:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:56,021 INFO L225 Difference]: With dead ends: 19958 [2024-11-16 08:29:56,021 INFO L226 Difference]: Without dead ends: 14491 [2024-11-16 08:29:56,031 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-16 08:29:56,031 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 227 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 1376 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:56,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 1376 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14491 states. [2024-11-16 08:29:56,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14491 to 14489. [2024-11-16 08:29:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14489 states, 14488 states have (on average 1.5037272225289895) internal successors, (21786), 14488 states have internal predecessors, (21786), 0 states have call successors, (0), 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-16 08:29:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14489 states to 14489 states and 21786 transitions. [2024-11-16 08:29:56,259 INFO L78 Accepts]: Start accepts. Automaton has 14489 states and 21786 transitions. Word has length 138 [2024-11-16 08:29:56,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:56,260 INFO L471 AbstractCegarLoop]: Abstraction has 14489 states and 21786 transitions. [2024-11-16 08:29:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 14489 states and 21786 transitions. [2024-11-16 08:29:56,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:29:56,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:56,262 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 08:29:56,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash 807045093, now seen corresponding path program 1 times [2024-11-16 08:29:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819422755] [2024-11-16 08:29:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:56,343 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-16 08:29:56,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819422755] [2024-11-16 08:29:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819422755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:56,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:56,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:56,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163166219] [2024-11-16 08:29:56,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:56,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:56,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:56,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:56,344 INFO L87 Difference]: Start difference. First operand 14489 states and 21786 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:56,415 INFO L93 Difference]: Finished difference Result 27867 states and 41952 transitions. [2024-11-16 08:29:56,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:29:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:56,446 INFO L225 Difference]: With dead ends: 27867 [2024-11-16 08:29:56,447 INFO L226 Difference]: Without dead ends: 20198 [2024-11-16 08:29:56,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-16 08:29:56,464 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 218 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:56,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 1347 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:56,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20198 states. [2024-11-16 08:29:56,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20198 to 20196. [2024-11-16 08:29:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20196 states, 20195 states have (on average 1.4984897251795) internal successors, (30262), 20195 states have internal predecessors, (30262), 0 states have call successors, (0), 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-16 08:29:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20196 states to 20196 states and 30262 transitions. [2024-11-16 08:29:56,753 INFO L78 Accepts]: Start accepts. Automaton has 20196 states and 30262 transitions. Word has length 138 [2024-11-16 08:29:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:56,753 INFO L471 AbstractCegarLoop]: Abstraction has 20196 states and 30262 transitions. [2024-11-16 08:29:56,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 20196 states and 30262 transitions. [2024-11-16 08:29:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:29:56,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:56,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:56,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 08:29:56,755 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:56,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1479713087, now seen corresponding path program 1 times [2024-11-16 08:29:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:56,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173449256] [2024-11-16 08:29:56,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:56,957 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-16 08:29:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173449256] [2024-11-16 08:29:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173449256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 08:29:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083755513] [2024-11-16 08:29:56,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:56,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 08:29:56,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 08:29:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 08:29:56,959 INFO L87 Difference]: Start difference. First operand 20196 states and 30262 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:57,056 INFO L93 Difference]: Finished difference Result 38660 states and 58004 transitions. [2024-11-16 08:29:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 08:29:57,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:29:57,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:57,098 INFO L225 Difference]: With dead ends: 38660 [2024-11-16 08:29:57,098 INFO L226 Difference]: Without dead ends: 27953 [2024-11-16 08:29:57,119 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-16 08:29:57,120 INFO L432 NwaCegarLoop]: 735 mSDtfsCounter, 209 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:57,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1318 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:57,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27953 states. [2024-11-16 08:29:57,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27953 to 27951. [2024-11-16 08:29:57,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27951 states, 27950 states have (on average 1.4925223613595706) internal successors, (41716), 27950 states have internal predecessors, (41716), 0 states have call successors, (0), 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-16 08:29:57,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27951 states to 27951 states and 41716 transitions. [2024-11-16 08:29:57,630 INFO L78 Accepts]: Start accepts. Automaton has 27951 states and 41716 transitions. Word has length 138 [2024-11-16 08:29:57,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:57,631 INFO L471 AbstractCegarLoop]: Abstraction has 27951 states and 41716 transitions. [2024-11-16 08:29:57,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 27951 states and 41716 transitions. [2024-11-16 08:29:57,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 08:29:57,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:57,632 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:57,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 08:29:57,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:57,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:57,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1923661655, now seen corresponding path program 1 times [2024-11-16 08:29:57,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:57,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756874440] [2024-11-16 08:29:57,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:57,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:57,829 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-16 08:29:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756874440] [2024-11-16 08:29:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756874440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:57,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:57,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:29:57,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432343426] [2024-11-16 08:29:57,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:57,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:29:57,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:57,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:29:57,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:29:57,831 INFO L87 Difference]: Start difference. First operand 27951 states and 41716 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:58,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:58,017 INFO L93 Difference]: Finished difference Result 91222 states and 136359 transitions. [2024-11-16 08:29:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:29:58,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2024-11-16 08:29:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:58,107 INFO L225 Difference]: With dead ends: 91222 [2024-11-16 08:29:58,107 INFO L226 Difference]: Without dead ends: 63573 [2024-11-16 08:29:58,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:29:58,250 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 749 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:58,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 2046 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:29:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63573 states. [2024-11-16 08:29:58,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63573 to 45673. [2024-11-16 08:29:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45673 states, 45672 states have (on average 1.488176563321072) internal successors, (67968), 45672 states have internal predecessors, (67968), 0 states have call successors, (0), 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-16 08:29:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45673 states to 45673 states and 67968 transitions. [2024-11-16 08:29:58,860 INFO L78 Accepts]: Start accepts. Automaton has 45673 states and 67968 transitions. Word has length 138 [2024-11-16 08:29:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:29:58,860 INFO L471 AbstractCegarLoop]: Abstraction has 45673 states and 67968 transitions. [2024-11-16 08:29:58,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 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-16 08:29:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 45673 states and 67968 transitions. [2024-11-16 08:29:58,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 08:29:58,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:29:58,862 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:29:58,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 08:29:58,862 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:29:58,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:29:58,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1324643429, now seen corresponding path program 1 times [2024-11-16 08:29:58,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:29:58,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102446066] [2024-11-16 08:29:58,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:29:58,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:29:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:29:58,977 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-16 08:29:58,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:29:58,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102446066] [2024-11-16 08:29:58,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102446066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:29:58,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:29:58,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:29:58,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446725378] [2024-11-16 08:29:58,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:29:58,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:29:58,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:29:58,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:29:58,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:29:58,978 INFO L87 Difference]: Start difference. First operand 45673 states and 67968 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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-16 08:29:59,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:29:59,487 INFO L93 Difference]: Finished difference Result 148430 states and 221227 transitions. [2024-11-16 08:29:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:29:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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 140 [2024-11-16 08:29:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:29:59,825 INFO L225 Difference]: With dead ends: 148430 [2024-11-16 08:29:59,825 INFO L226 Difference]: Without dead ends: 103059 [2024-11-16 08:29:59,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:29:59,855 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 747 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:29:59,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2048 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:29:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103059 states. [2024-11-16 08:30:00,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103059 to 74223. [2024-11-16 08:30:00,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74223 states, 74222 states have (on average 1.483818813828784) internal successors, (110132), 74222 states have internal predecessors, (110132), 0 states have call successors, (0), 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-16 08:30:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74223 states to 74223 states and 110132 transitions. [2024-11-16 08:30:01,078 INFO L78 Accepts]: Start accepts. Automaton has 74223 states and 110132 transitions. Word has length 140 [2024-11-16 08:30:01,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:01,078 INFO L471 AbstractCegarLoop]: Abstraction has 74223 states and 110132 transitions. [2024-11-16 08:30:01,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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-16 08:30:01,079 INFO L276 IsEmpty]: Start isEmpty. Operand 74223 states and 110132 transitions. [2024-11-16 08:30:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-16 08:30:01,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:01,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:01,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 08:30:01,080 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:01,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1775712635, now seen corresponding path program 1 times [2024-11-16 08:30:01,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:01,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067049573] [2024-11-16 08:30:01,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:01,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:01,193 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-16 08:30:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:01,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067049573] [2024-11-16 08:30:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067049573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 08:30:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419103879] [2024-11-16 08:30:01,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 08:30:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 08:30:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 08:30:01,196 INFO L87 Difference]: Start difference. First operand 74223 states and 110132 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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-16 08:30:02,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:02,060 INFO L93 Difference]: Finished difference Result 238502 states and 354423 transitions. [2024-11-16 08:30:02,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 08:30:02,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-16 08:30:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:30:02,341 INFO L225 Difference]: With dead ends: 238502 [2024-11-16 08:30:02,341 INFO L226 Difference]: Without dead ends: 164581 [2024-11-16 08:30:02,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:30:02,392 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 745 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 2050 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:30:02,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 2050 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:30:02,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164581 states. [2024-11-16 08:30:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164581 to 119177. [2024-11-16 08:30:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119177 states, 119176 states have (on average 1.4794925152715312) internal successors, (176320), 119176 states have internal predecessors, (176320), 0 states have call successors, (0), 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-16 08:30:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119177 states to 119177 states and 176320 transitions. [2024-11-16 08:30:04,023 INFO L78 Accepts]: Start accepts. Automaton has 119177 states and 176320 transitions. Word has length 142 [2024-11-16 08:30:04,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:04,023 INFO L471 AbstractCegarLoop]: Abstraction has 119177 states and 176320 transitions. [2024-11-16 08:30:04,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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-16 08:30:04,023 INFO L276 IsEmpty]: Start isEmpty. Operand 119177 states and 176320 transitions. [2024-11-16 08:30:04,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 08:30:04,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:04,024 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:04,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 08:30:04,024 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:04,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:04,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1641834039, now seen corresponding path program 1 times [2024-11-16 08:30:04,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:04,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225783846] [2024-11-16 08:30:04,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:04,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:04,663 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-16 08:30:04,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:04,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225783846] [2024-11-16 08:30:04,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225783846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:04,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:04,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:30:04,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738285218] [2024-11-16 08:30:04,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:04,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:30:04,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:04,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:30:04,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:30:04,665 INFO L87 Difference]: Start difference. First operand 119177 states and 176320 transitions. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 08:30:05,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:05,239 INFO L93 Difference]: Finished difference Result 238054 states and 352192 transitions. [2024-11-16 08:30:05,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:30:05,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-11-16 08:30:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:30:05,752 INFO L225 Difference]: With dead ends: 238054 [2024-11-16 08:30:05,752 INFO L226 Difference]: Without dead ends: 119179 [2024-11-16 08:30:05,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:30:05,796 INFO L432 NwaCegarLoop]: 617 mSDtfsCounter, 639 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 2375 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:30:05,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 2375 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:30:05,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119179 states. [2024-11-16 08:30:07,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119179 to 119177. [2024-11-16 08:30:07,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119177 states, 119176 states have (on average 1.4742481707726387) internal successors, (175695), 119176 states have internal predecessors, (175695), 0 states have call successors, (0), 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-16 08:30:07,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119177 states to 119177 states and 175695 transitions. [2024-11-16 08:30:07,287 INFO L78 Accepts]: Start accepts. Automaton has 119177 states and 175695 transitions. Word has length 145 [2024-11-16 08:30:07,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:07,287 INFO L471 AbstractCegarLoop]: Abstraction has 119177 states and 175695 transitions. [2024-11-16 08:30:07,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 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-16 08:30:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 119177 states and 175695 transitions. [2024-11-16 08:30:07,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-16 08:30:07,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:07,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:07,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 08:30:07,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:07,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:07,289 INFO L85 PathProgramCache]: Analyzing trace with hash -747480725, now seen corresponding path program 1 times [2024-11-16 08:30:07,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:07,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491253770] [2024-11-16 08:30:07,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:07,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:07,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:07,567 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-16 08:30:07,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:07,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491253770] [2024-11-16 08:30:07,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491253770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:07,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:07,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:30:07,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969184345] [2024-11-16 08:30:07,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:07,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:30:07,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:07,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:30:07,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:30:07,568 INFO L87 Difference]: Start difference. First operand 119177 states and 175695 transitions. Second operand has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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-16 08:30:08,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:08,671 INFO L93 Difference]: Finished difference Result 348236 states and 513932 transitions. [2024-11-16 08:30:08,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:30:08,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2024-11-16 08:30:08,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:30:08,971 INFO L225 Difference]: With dead ends: 348236 [2024-11-16 08:30:08,971 INFO L226 Difference]: Without dead ends: 229361 [2024-11-16 08:30:09,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 08:30:09,100 INFO L432 NwaCegarLoop]: 606 mSDtfsCounter, 627 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 08:30:09,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2382 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 08:30:09,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229361 states. [2024-11-16 08:30:11,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229361 to 229359. [2024-11-16 08:30:12,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229359 states, 229358 states have (on average 1.4678711882733544) internal successors, (336668), 229358 states have internal predecessors, (336668), 0 states have call successors, (0), 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-16 08:30:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229359 states to 229359 states and 336668 transitions. [2024-11-16 08:30:12,460 INFO L78 Accepts]: Start accepts. Automaton has 229359 states and 336668 transitions. Word has length 152 [2024-11-16 08:30:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:12,461 INFO L471 AbstractCegarLoop]: Abstraction has 229359 states and 336668 transitions. [2024-11-16 08:30:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.333333333333332) internal successors, (152), 6 states have internal predecessors, (152), 0 states have call successors, (0), 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-16 08:30:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 229359 states and 336668 transitions. [2024-11-16 08:30:12,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-16 08:30:12,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:12,462 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:12,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 08:30:12,462 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash -385490527, now seen corresponding path program 1 times [2024-11-16 08:30:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:12,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780759949] [2024-11-16 08:30:12,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:12,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:13,534 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-16 08:30:13,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780759949] [2024-11-16 08:30:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780759949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:13,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:13,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 08:30:13,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221617454] [2024-11-16 08:30:13,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:13,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 08:30:13,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:13,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 08:30:13,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:30:13,536 INFO L87 Difference]: Start difference. First operand 229359 states and 336668 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-16 08:30:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:14,027 INFO L93 Difference]: Finished difference Result 248263 states and 357507 transitions. [2024-11-16 08:30:14,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 08:30:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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 155 [2024-11-16 08:30:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:30:14,355 INFO L225 Difference]: With dead ends: 248263 [2024-11-16 08:30:14,355 INFO L226 Difference]: Without dead ends: 248261 [2024-11-16 08:30:14,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 08:30:14,437 INFO L432 NwaCegarLoop]: 616 mSDtfsCounter, 0 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 08:30:14,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2447 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 08:30:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248261 states. [2024-11-16 08:30:17,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248261 to 248261. [2024-11-16 08:30:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248261 states, 248260 states have (on average 1.4321396922581164) internal successors, (355543), 248260 states have internal predecessors, (355543), 0 states have call successors, (0), 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-16 08:30:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248261 states to 248261 states and 355543 transitions. [2024-11-16 08:30:18,134 INFO L78 Accepts]: Start accepts. Automaton has 248261 states and 355543 transitions. Word has length 155 [2024-11-16 08:30:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:18,134 INFO L471 AbstractCegarLoop]: Abstraction has 248261 states and 355543 transitions. [2024-11-16 08:30:18,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 0 states have call successors, (0), 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-16 08:30:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 248261 states and 355543 transitions. [2024-11-16 08:30:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 08:30:18,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:18,139 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 08:30:18,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1087534519, now seen corresponding path program 1 times [2024-11-16 08:30:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:18,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085796146] [2024-11-16 08:30:18,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:18,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 08:30:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:18,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085796146] [2024-11-16 08:30:18,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085796146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:18,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:18,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:30:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743019874] [2024-11-16 08:30:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:18,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:30:18,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:30:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:30:18,328 INFO L87 Difference]: Start difference. First operand 248261 states and 355543 transitions. Second operand has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:30:21,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:21,228 INFO L93 Difference]: Finished difference Result 682527 states and 978802 transitions. [2024-11-16 08:30:21,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:30:21,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-11-16 08:30:21,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 08:30:22,085 INFO L225 Difference]: With dead ends: 682527 [2024-11-16 08:30:22,086 INFO L226 Difference]: Without dead ends: 570025 [2024-11-16 08:30:22,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-16 08:30:22,183 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 1500 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 3577 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 08:30:22,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 3577 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 08:30:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570025 states. [2024-11-16 08:30:27,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570025 to 400599. [2024-11-16 08:30:27,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400599 states, 400598 states have (on average 1.4298698445823494) internal successors, (572803), 400598 states have internal predecessors, (572803), 0 states have call successors, (0), 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-16 08:30:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400599 states to 400599 states and 572803 transitions. [2024-11-16 08:30:29,207 INFO L78 Accepts]: Start accepts. Automaton has 400599 states and 572803 transitions. Word has length 199 [2024-11-16 08:30:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 08:30:29,207 INFO L471 AbstractCegarLoop]: Abstraction has 400599 states and 572803 transitions. [2024-11-16 08:30:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.0) internal successors, (198), 6 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 08:30:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 400599 states and 572803 transitions. [2024-11-16 08:30:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 08:30:29,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 08:30:29,212 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 08:30:29,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 08:30:29,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 08:30:29,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 08:30:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash 472370579, now seen corresponding path program 1 times [2024-11-16 08:30:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 08:30:29,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576087321] [2024-11-16 08:30:29,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 08:30:29,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 08:30:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 08:30:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-16 08:30:29,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 08:30:29,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576087321] [2024-11-16 08:30:29,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576087321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 08:30:29,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 08:30:29,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 08:30:29,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895791529] [2024-11-16 08:30:29,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 08:30:29,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 08:30:29,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 08:30:29,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 08:30:29,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 08:30:29,415 INFO L87 Difference]: Start difference. First operand 400599 states and 572803 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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-16 08:30:31,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 08:30:31,874 INFO L93 Difference]: Finished difference Result 767213 states and 1100778 transitions. [2024-11-16 08:30:31,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 08:30:31,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 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 199 [2024-11-16 08:30:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted.