./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-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 a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:57:07,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:57:07,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:57:07,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:57:07,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:57:07,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:57:07,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:57:07,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:57:07,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:57:07,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:57:07,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:57:07,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:57:07,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:57:07,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:57:07,672 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:57:07,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:57:07,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:57:07,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:57:07,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:57:07,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:57:07,673 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:57:07,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:57:07,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:57:07,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:57:07,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:57:07,675 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:57:07,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:57:07,675 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:57:07,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:57:07,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:57:07,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:57:07,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:57:07,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:07,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:57:07,677 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:57:07,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:57:07,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:57:07,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:57:07,678 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:57:07,678 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:57:07,678 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:57:07,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:57:07,679 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 -> a158f4486af48c98a7df56cba98940178e8617d42ff04ad885cda239ab95e10a [2024-11-09 23:57:07,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:57:07,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:57:07,943 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:57:07,944 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:57:07,945 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:57:07,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:57:09,293 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:57:09,489 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:57:09,490 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:57:09,505 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0804583a9/05d0b539e29145fd962b2a25547dd9cf/FLAG9e2b77031 [2024-11-09 23:57:09,518 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0804583a9/05d0b539e29145fd962b2a25547dd9cf [2024-11-09 23:57:09,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:57:09,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:57:09,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:09,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:57:09,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:57:09,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:09,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31def412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09, skipping insertion in model container [2024-11-09 23:57:09,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:09,565 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:57:09,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2024-11-09 23:57:09,801 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2024-11-09 23:57:09,808 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2024-11-09 23:57:09,812 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2024-11-09 23:57:09,817 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2024-11-09 23:57:09,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2024-11-09 23:57:09,824 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2024-11-09 23:57:09,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:09,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:57:09,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[7119,7132] [2024-11-09 23:57:09,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[9806,9819] [2024-11-09 23:57:09,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10897,10910] [2024-11-09 23:57:09,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[11503,11516] [2024-11-09 23:57:09,952 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[12922,12935] [2024-11-09 23:57:09,955 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13528,13541] [2024-11-09 23:57:09,958 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14457,14470] [2024-11-09 23:57:09,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:57:09,994 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:57:09,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09 WrapperNode [2024-11-09 23:57:09,994 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:57:09,995 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:09,995 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:57:09,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:57:10,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,013 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,067 INFO L138 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1049 [2024-11-09 23:57:10,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:57:10,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:57:10,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:57:10,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:57:10,077 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,099 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 23:57:10,099 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,113 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,131 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,136 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:57:10,137 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:57:10,137 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:57:10,137 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:57:10,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (1/1) ... [2024-11-09 23:57:10,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:57:10,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:10,171 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:57:10,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:57:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:57:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:57:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:57:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:57:10,337 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:57:10,338 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:57:11,007 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L498: havoc main_~node2____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522: havoc main_~node3____CPAchecker_TMP_0~4#1;havoc main_~node3__m3~8#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L996: havoc main_~__tmp_9~0#1, main_~assert__arg~8#1;havoc main_~check__tmp~8#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L964: havoc main_~node3__m3~5#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L835: havoc main_~node3__m3~4#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:57:11,008 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1299: havoc main_~__tmp_12~0#1, main_~assert__arg~11#1;havoc main_~check__tmp~12#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1234: havoc main_~__tmp_11~0#1, main_~assert__arg~10#1;havoc main_~check__tmp~11#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L673: havoc main_~node3__m3~3#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1202: havoc main_~node3____CPAchecker_TMP_0~2#1;havoc main_~node3__m3~6#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:57:11,009 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L311: havoc main_~node1__m1~2#1;havoc main_~__tmp_2~0#1, main_~assert__arg~1#1;havoc main_~check__tmp~1#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L246: havoc main_~node2__m2~1#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,010 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,011 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L180: havoc main_~node3____CPAchecker_TMP_0~0#1;havoc main_~node3__m3~0#1;havoc main_~node2____CPAchecker_TMP_0~0#1;havoc main_~node2__m2~0#1;havoc main_~node1____CPAchecker_TMP_0~0#1;havoc main_~node1__m1~0#1;havoc main_~init__tmp~0#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1469: havoc main_~__tmp_14~0#1, main_~assert__arg~13#1;havoc main_~check__tmp~14#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L346: havoc main_~node3__m3~2#1;havoc main_~node2__m2~2#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L875: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:57:11,012 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L875: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L875: havoc main_~__tmp_7~0#1, main_~assert__arg~6#1;havoc main_~check__tmp~6#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1404: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1404: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1404: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1404: havoc main_~__tmp_13~0#1, main_~assert__arg~12#1;havoc main_~check__tmp~13#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1372: havoc main_~node3____CPAchecker_TMP_0~3#1;havoc main_~node3__m3~7#1;havoc main_~node2____CPAchecker_TMP_0~2#1;havoc main_~node2__m2~4#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L713: havoc main_~__tmp_5~0#1, main_~assert__arg~4#1;havoc main_~check__tmp~4#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:11,013 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L383: havoc main_~__tmp_3~0#1, main_~assert__arg~2#1;havoc main_~check__tmp~2#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L549: havoc main_~node1____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L453: havoc main_~node3____CPAchecker_TMP_0~1#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L224: havoc main_~node1__m1~1#1;havoc main_~__tmp_1~0#1, main_~assert__arg~0#1;havoc main_~check__tmp~0#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1149: havoc main_~__tmp_10~0#1, main_~assert__arg~9#1;havoc main_~check__tmp~10#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L820: havoc main_~node2__m2~3#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L261: havoc main_~node3__m3~1#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L922: havoc main_~__tmp_8~0#1, main_~assert__arg~7#1;havoc main_~check__tmp~7#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:57:11,014 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L625: havoc main_~__tmp_4~0#1, main_~assert__arg~3#1;havoc main_~check__tmp~3#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L760: havoc main_~__tmp_6~0#1, main_~assert__arg~5#1;havoc main_~check__tmp~5#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: havoc main_~__tmp_16~0#1, main_~assert__arg~15#1;havoc main_~check__tmp~16#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1554: havoc main_~__tmp_15~0#1, main_~assert__arg~14#1;havoc main_~check__tmp~15#1; [2024-11-09 23:57:11,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026: havoc main_~check__tmp~9#1; [2024-11-09 23:57:11,062 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-09 23:57:11,062 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:57:11,081 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:57:11,081 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:57:11,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:11 BoogieIcfgContainer [2024-11-09 23:57:11,084 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:57:11,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:57:11,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:57:11,089 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:57:11,089 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:57:09" (1/3) ... [2024-11-09 23:57:11,089 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2e077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:11, skipping insertion in model container [2024-11-09 23:57:11,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:57:09" (2/3) ... [2024-11-09 23:57:11,090 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c2e077a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:57:11, skipping insertion in model container [2024-11-09 23:57:11,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:57:11" (3/3) ... [2024-11-09 23:57:11,091 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-11-09 23:57:11,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:57:11,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-11-09 23:57:11,165 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:57:11,172 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;@10e5adfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:57:11,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-09 23:57:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 209 states have (on average 1.7799043062200957) internal successors, (372), 216 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:11,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 23:57:11,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:11,190 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] [2024-11-09 23:57:11,191 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:11,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:11,195 INFO L85 PathProgramCache]: Analyzing trace with hash -125623041, now seen corresponding path program 1 times [2024-11-09 23:57:11,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752761475] [2024-11-09 23:57:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:11,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:11,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:11,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752761475] [2024-11-09 23:57:11,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752761475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:11,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:11,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:11,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169393597] [2024-11-09 23:57:11,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:11,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:11,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:11,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:11,737 INFO L87 Difference]: Start difference. First operand has 217 states, 209 states have (on average 1.7799043062200957) internal successors, (372), 216 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:11,966 INFO L93 Difference]: Finished difference Result 441 states and 723 transitions. [2024-11-09 23:57:11,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:11,969 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-11-09 23:57:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:11,976 INFO L225 Difference]: With dead ends: 441 [2024-11-09 23:57:11,977 INFO L226 Difference]: Without dead ends: 266 [2024-11-09 23:57:11,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:11,982 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1128 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1128 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:11,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1128 Valid, 318 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-09 23:57:12,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 242. [2024-11-09 23:57:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 235 states have (on average 1.3404255319148937) internal successors, (315), 241 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 315 transitions. [2024-11-09 23:57:12,018 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 315 transitions. Word has length 46 [2024-11-09 23:57:12,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:12,018 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 315 transitions. [2024-11-09 23:57:12,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,019 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 315 transitions. [2024-11-09 23:57:12,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 23:57:12,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:12,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:12,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 23:57:12,020 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:12,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:12,021 INFO L85 PathProgramCache]: Analyzing trace with hash 808760672, now seen corresponding path program 1 times [2024-11-09 23:57:12,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125663068] [2024-11-09 23:57:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:12,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:12,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:12,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125663068] [2024-11-09 23:57:12,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125663068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:12,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:12,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:12,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318600828] [2024-11-09 23:57:12,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:12,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:12,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:12,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:12,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:12,147 INFO L87 Difference]: Start difference. First operand 242 states and 315 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:12,245 INFO L93 Difference]: Finished difference Result 433 states and 576 transitions. [2024-11-09 23:57:12,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:12,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-09 23:57:12,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:12,247 INFO L225 Difference]: With dead ends: 433 [2024-11-09 23:57:12,247 INFO L226 Difference]: Without dead ends: 229 [2024-11-09 23:57:12,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:12,248 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 573 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:12,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 136 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-09 23:57:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-09 23:57:12,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 222 states have (on average 1.3423423423423424) internal successors, (298), 228 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 298 transitions. [2024-11-09 23:57:12,261 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 298 transitions. Word has length 47 [2024-11-09 23:57:12,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:12,261 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 298 transitions. [2024-11-09 23:57:12,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,262 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 298 transitions. [2024-11-09 23:57:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 23:57:12,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:12,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 23:57:12,264 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1420052961, now seen corresponding path program 1 times [2024-11-09 23:57:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:12,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488867871] [2024-11-09 23:57:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488867871] [2024-11-09 23:57:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488867871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 23:57:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746782516] [2024-11-09 23:57:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:12,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:12,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:12,389 INFO L87 Difference]: Start difference. First operand 229 states and 298 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:12,497 INFO L93 Difference]: Finished difference Result 420 states and 557 transitions. [2024-11-09 23:57:12,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:12,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-09 23:57:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:12,499 INFO L225 Difference]: With dead ends: 420 [2024-11-09 23:57:12,499 INFO L226 Difference]: Without dead ends: 224 [2024-11-09 23:57:12,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:12,500 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 539 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:12,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 133 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-09 23:57:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2024-11-09 23:57:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.336405529953917) internal successors, (290), 223 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 290 transitions. [2024-11-09 23:57:12,516 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 290 transitions. Word has length 48 [2024-11-09 23:57:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 290 transitions. [2024-11-09 23:57:12,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 290 transitions. [2024-11-09 23:57:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:12,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:12,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:12,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 23:57:12,519 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:12,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:12,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1377905308, now seen corresponding path program 1 times [2024-11-09 23:57:12,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:12,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925255516] [2024-11-09 23:57:12,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:12,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:12,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925255516] [2024-11-09 23:57:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925255516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:12,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:12,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:57:12,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915565001] [2024-11-09 23:57:12,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:12,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:57:12,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:12,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:57:12,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:57:12,811 INFO L87 Difference]: Start difference. First operand 224 states and 290 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:13,051 INFO L93 Difference]: Finished difference Result 484 states and 641 transitions. [2024-11-09 23:57:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:57:13,052 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:13,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:13,056 INFO L225 Difference]: With dead ends: 484 [2024-11-09 23:57:13,056 INFO L226 Difference]: Without dead ends: 352 [2024-11-09 23:57:13,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:57:13,058 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 1023 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:13,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 400 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-09 23:57:13,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 224. [2024-11-09 23:57:13,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.3317972350230414) internal successors, (289), 223 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 289 transitions. [2024-11-09 23:57:13,073 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 289 transitions. Word has length 49 [2024-11-09 23:57:13,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:13,073 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 289 transitions. [2024-11-09 23:57:13,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 289 transitions. [2024-11-09 23:57:13,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:13,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:13,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:13,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 23:57:13,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash 122618503, now seen corresponding path program 1 times [2024-11-09 23:57:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:13,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462306783] [2024-11-09 23:57:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:13,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462306783] [2024-11-09 23:57:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462306783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:13,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:13,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:13,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984447299] [2024-11-09 23:57:13,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:13,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:13,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:13,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:13,317 INFO L87 Difference]: Start difference. First operand 224 states and 289 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:13,685 INFO L93 Difference]: Finished difference Result 432 states and 586 transitions. [2024-11-09 23:57:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:13,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:13,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:13,687 INFO L225 Difference]: With dead ends: 432 [2024-11-09 23:57:13,687 INFO L226 Difference]: Without dead ends: 323 [2024-11-09 23:57:13,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:57:13,689 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 693 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:13,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 762 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-09 23:57:13,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 224. [2024-11-09 23:57:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.327188940092166) internal successors, (288), 223 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 288 transitions. [2024-11-09 23:57:13,701 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 288 transitions. Word has length 49 [2024-11-09 23:57:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 288 transitions. [2024-11-09 23:57:13,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 288 transitions. [2024-11-09 23:57:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 23:57:13,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:13,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:13,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 23:57:13,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:13,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:13,705 INFO L85 PathProgramCache]: Analyzing trace with hash 548499752, now seen corresponding path program 1 times [2024-11-09 23:57:13,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:13,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681860799] [2024-11-09 23:57:13,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:13,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:13,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681860799] [2024-11-09 23:57:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681860799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367660257] [2024-11-09 23:57:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:13,923 INFO L87 Difference]: Start difference. First operand 224 states and 288 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:14,178 INFO L93 Difference]: Finished difference Result 375 states and 489 transitions. [2024-11-09 23:57:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:57:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 23:57:14,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:14,181 INFO L225 Difference]: With dead ends: 375 [2024-11-09 23:57:14,181 INFO L226 Difference]: Without dead ends: 370 [2024-11-09 23:57:14,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:57:14,182 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 857 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:14,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 565 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-09 23:57:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 224. [2024-11-09 23:57:14,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 217 states have (on average 1.3225806451612903) internal successors, (287), 223 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 287 transitions. [2024-11-09 23:57:14,189 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 287 transitions. Word has length 49 [2024-11-09 23:57:14,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:14,190 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 287 transitions. [2024-11-09 23:57:14,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 287 transitions. [2024-11-09 23:57:14,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:57:14,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:14,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:14,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:57:14,191 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:14,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:14,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1401849788, now seen corresponding path program 1 times [2024-11-09 23:57:14,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:14,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731295061] [2024-11-09 23:57:14,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:14,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:15,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:15,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731295061] [2024-11-09 23:57:15,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731295061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:15,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:15,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 23:57:15,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930536755] [2024-11-09 23:57:15,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:15,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 23:57:15,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:15,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 23:57:15,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:57:15,016 INFO L87 Difference]: Start difference. First operand 224 states and 287 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:16,142 INFO L93 Difference]: Finished difference Result 482 states and 638 transitions. [2024-11-09 23:57:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 23:57:16,142 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:57:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:16,144 INFO L225 Difference]: With dead ends: 482 [2024-11-09 23:57:16,144 INFO L226 Difference]: Without dead ends: 478 [2024-11-09 23:57:16,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1023, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 23:57:16,146 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 1152 mSDsluCounter, 2222 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:16,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2431 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 23:57:16,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-09 23:57:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 228. [2024-11-09 23:57:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 221 states have (on average 1.3257918552036199) internal successors, (293), 227 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 293 transitions. [2024-11-09 23:57:16,154 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 293 transitions. Word has length 51 [2024-11-09 23:57:16,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:16,154 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 293 transitions. [2024-11-09 23:57:16,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 293 transitions. [2024-11-09 23:57:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:57:16,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:16,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] [2024-11-09 23:57:16,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:57:16,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:16,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:16,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1144718105, now seen corresponding path program 1 times [2024-11-09 23:57:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754529411] [2024-11-09 23:57:16,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:16,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:16,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:16,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754529411] [2024-11-09 23:57:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754529411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 23:57:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368285171] [2024-11-09 23:57:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:16,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 23:57:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 23:57:16,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:57:16,954 INFO L87 Difference]: Start difference. First operand 228 states and 293 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:18,060 INFO L93 Difference]: Finished difference Result 493 states and 665 transitions. [2024-11-09 23:57:18,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 23:57:18,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:57:18,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:18,064 INFO L225 Difference]: With dead ends: 493 [2024-11-09 23:57:18,064 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 23:57:18,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 23:57:18,065 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 1149 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 2178 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:18,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 2178 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:57:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 23:57:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 234. [2024-11-09 23:57:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 227 states have (on average 1.3259911894273129) internal successors, (301), 233 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 301 transitions. [2024-11-09 23:57:18,070 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 301 transitions. Word has length 51 [2024-11-09 23:57:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:18,070 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 301 transitions. [2024-11-09 23:57:18,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 19 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,071 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 301 transitions. [2024-11-09 23:57:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-09 23:57:18,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:18,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:18,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:57:18,072 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:18,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 38977831, now seen corresponding path program 1 times [2024-11-09 23:57:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:18,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099612036] [2024-11-09 23:57:18,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:18,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:18,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:18,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099612036] [2024-11-09 23:57:18,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099612036] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:18,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:18,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:57:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756698245] [2024-11-09 23:57:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:18,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:57:18,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:18,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:57:18,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:57:18,401 INFO L87 Difference]: Start difference. First operand 234 states and 301 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:18,672 INFO L93 Difference]: Finished difference Result 373 states and 505 transitions. [2024-11-09 23:57:18,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:57:18,673 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2024-11-09 23:57:18,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:18,674 INFO L225 Difference]: With dead ends: 373 [2024-11-09 23:57:18,674 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 23:57:18,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:57:18,675 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 350 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:18,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1110 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 23:57:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 223. [2024-11-09 23:57:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.327188940092166) internal successors, (288), 222 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 288 transitions. [2024-11-09 23:57:18,679 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 288 transitions. Word has length 51 [2024-11-09 23:57:18,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:18,679 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 288 transitions. [2024-11-09 23:57:18,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:18,680 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 288 transitions. [2024-11-09 23:57:18,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:18,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:18,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:18,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:57:18,681 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:18,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:18,681 INFO L85 PathProgramCache]: Analyzing trace with hash -579628547, now seen corresponding path program 1 times [2024-11-09 23:57:18,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:18,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589932437] [2024-11-09 23:57:18,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:18,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:18,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:18,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:18,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:18,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589932437] [2024-11-09 23:57:18,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589932437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:18,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:18,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:18,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782581356] [2024-11-09 23:57:18,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:18,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:18,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:18,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:18,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:18,846 INFO L87 Difference]: Start difference. First operand 223 states and 288 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:19,148 INFO L93 Difference]: Finished difference Result 444 states and 601 transitions. [2024-11-09 23:57:19,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:19,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:19,150 INFO L225 Difference]: With dead ends: 444 [2024-11-09 23:57:19,150 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 23:57:19,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:57:19,151 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 590 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:19,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 707 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 23:57:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2024-11-09 23:57:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.3179723502304148) internal successors, (286), 222 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 286 transitions. [2024-11-09 23:57:19,156 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 286 transitions. Word has length 52 [2024-11-09 23:57:19,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:19,157 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 286 transitions. [2024-11-09 23:57:19,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,157 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 286 transitions. [2024-11-09 23:57:19,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:19,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:19,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:19,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:57:19,167 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:19,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:19,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1956367777, now seen corresponding path program 1 times [2024-11-09 23:57:19,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:19,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254768022] [2024-11-09 23:57:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:19,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:19,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254768022] [2024-11-09 23:57:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254768022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:19,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142327819] [2024-11-09 23:57:19,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:19,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:19,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:19,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:19,350 INFO L87 Difference]: Start difference. First operand 223 states and 286 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:19,629 INFO L93 Difference]: Finished difference Result 366 states and 476 transitions. [2024-11-09 23:57:19,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:57:19,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:19,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:19,630 INFO L225 Difference]: With dead ends: 366 [2024-11-09 23:57:19,630 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 23:57:19,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:57:19,631 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 790 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:19,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 696 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:19,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 23:57:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2024-11-09 23:57:19,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.3087557603686637) internal successors, (284), 222 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 284 transitions. [2024-11-09 23:57:19,636 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 284 transitions. Word has length 52 [2024-11-09 23:57:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:19,636 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 284 transitions. [2024-11-09 23:57:19,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 284 transitions. [2024-11-09 23:57:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:19,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:19,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:57:19,637 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:19,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:19,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1719748123, now seen corresponding path program 1 times [2024-11-09 23:57:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593617802] [2024-11-09 23:57:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:19,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593617802] [2024-11-09 23:57:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593617802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:19,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:19,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:57:19,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843947821] [2024-11-09 23:57:19,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:19,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:19,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:19,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:57:19,799 INFO L87 Difference]: Start difference. First operand 223 states and 284 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:20,056 INFO L93 Difference]: Finished difference Result 366 states and 474 transitions. [2024-11-09 23:57:20,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:57:20,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:20,058 INFO L225 Difference]: With dead ends: 366 [2024-11-09 23:57:20,058 INFO L226 Difference]: Without dead ends: 359 [2024-11-09 23:57:20,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-09 23:57:20,058 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 680 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:20,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 544 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:20,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-09 23:57:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 223. [2024-11-09 23:57:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 217 states have (on average 1.2995391705069124) internal successors, (282), 222 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:20,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 282 transitions. [2024-11-09 23:57:20,063 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 282 transitions. Word has length 52 [2024-11-09 23:57:20,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:20,063 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 282 transitions. [2024-11-09 23:57:20,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 8 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:20,064 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 282 transitions. [2024-11-09 23:57:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:20,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:20,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:20,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:57:20,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:20,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:20,065 INFO L85 PathProgramCache]: Analyzing trace with hash 225418843, now seen corresponding path program 1 times [2024-11-09 23:57:20,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285111284] [2024-11-09 23:57:20,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:20,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:20,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285111284] [2024-11-09 23:57:20,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285111284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:20,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:20,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 23:57:20,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331744165] [2024-11-09 23:57:20,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:20,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:57:20,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:57:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:57:20,576 INFO L87 Difference]: Start difference. First operand 223 states and 282 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:21,138 INFO L93 Difference]: Finished difference Result 447 states and 598 transitions. [2024-11-09 23:57:21,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 23:57:21,140 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:21,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:21,141 INFO L225 Difference]: With dead ends: 447 [2024-11-09 23:57:21,141 INFO L226 Difference]: Without dead ends: 351 [2024-11-09 23:57:21,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=447, Unknown=0, NotChecked=0, Total=600 [2024-11-09 23:57:21,142 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 373 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:21,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1966 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:57:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-09 23:57:21,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 213. [2024-11-09 23:57:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.2980769230769231) internal successors, (270), 212 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2024-11-09 23:57:21,146 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 52 [2024-11-09 23:57:21,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:21,146 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2024-11-09 23:57:21,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2024-11-09 23:57:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 23:57:21,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:21,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:57:21,148 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:21,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:21,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1688024508, now seen corresponding path program 1 times [2024-11-09 23:57:21,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:21,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589391094] [2024-11-09 23:57:21,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:21,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:21,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589391094] [2024-11-09 23:57:21,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589391094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:21,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:21,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 23:57:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332889455] [2024-11-09 23:57:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:21,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:57:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:57:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:57:21,713 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:22,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:22,554 INFO L93 Difference]: Finished difference Result 251 states and 305 transitions. [2024-11-09 23:57:22,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:57:22,554 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-09 23:57:22,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:22,555 INFO L225 Difference]: With dead ends: 251 [2024-11-09 23:57:22,555 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 23:57:22,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:57:22,556 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 317 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:22,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 1713 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:57:22,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 23:57:22,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 205. [2024-11-09 23:57:22,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.2935323383084578) internal successors, (260), 204 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 260 transitions. [2024-11-09 23:57:22,560 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 260 transitions. Word has length 52 [2024-11-09 23:57:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:22,560 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 260 transitions. [2024-11-09 23:57:22,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 260 transitions. [2024-11-09 23:57:22,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:57:22,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:22,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:22,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:57:22,561 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:22,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1155595261, now seen corresponding path program 1 times [2024-11-09 23:57:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676862721] [2024-11-09 23:57:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:23,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:23,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:23,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676862721] [2024-11-09 23:57:23,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676862721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:23,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:23,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 23:57:23,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494099606] [2024-11-09 23:57:23,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:23,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:57:23,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:57:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:57:23,078 INFO L87 Difference]: Start difference. First operand 205 states and 260 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:23,776 INFO L93 Difference]: Finished difference Result 239 states and 295 transitions. [2024-11-09 23:57:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:57:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:57:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:23,777 INFO L225 Difference]: With dead ends: 239 [2024-11-09 23:57:23,777 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 23:57:23,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=814, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:57:23,778 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 355 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1458 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:23,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1458 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:57:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 23:57:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 211. [2024-11-09 23:57:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.2946859903381642) internal successors, (268), 210 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 268 transitions. [2024-11-09 23:57:23,781 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 268 transitions. Word has length 54 [2024-11-09 23:57:23,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:23,782 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 268 transitions. [2024-11-09 23:57:23,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:23,782 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 268 transitions. [2024-11-09 23:57:23,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:57:23,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:23,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:23,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:57:23,783 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:23,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:23,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1349367935, now seen corresponding path program 1 times [2024-11-09 23:57:23,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:23,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150428976] [2024-11-09 23:57:23,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:23,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:24,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:24,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:24,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150428976] [2024-11-09 23:57:24,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150428976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:24,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:24,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-09 23:57:24,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460761262] [2024-11-09 23:57:24,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:24,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 23:57:24,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:24,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 23:57:24,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:57:24,273 INFO L87 Difference]: Start difference. First operand 211 states and 268 transitions. Second operand has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:25,044 INFO L93 Difference]: Finished difference Result 359 states and 460 transitions. [2024-11-09 23:57:25,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:57:25,044 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:57:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:25,045 INFO L225 Difference]: With dead ends: 359 [2024-11-09 23:57:25,045 INFO L226 Difference]: Without dead ends: 351 [2024-11-09 23:57:25,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 23:57:25,046 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 508 mSDsluCounter, 2200 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:25,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 2434 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 23:57:25,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-09 23:57:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 211. [2024-11-09 23:57:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 207 states have (on average 1.289855072463768) internal successors, (267), 210 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 267 transitions. [2024-11-09 23:57:25,050 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 267 transitions. Word has length 54 [2024-11-09 23:57:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:25,050 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 267 transitions. [2024-11-09 23:57:25,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0) internal successors, (54), 18 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 267 transitions. [2024-11-09 23:57:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 23:57:25,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:25,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:25,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:57:25,051 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:25,052 INFO L85 PathProgramCache]: Analyzing trace with hash -661334789, now seen corresponding path program 1 times [2024-11-09 23:57:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:25,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416608210] [2024-11-09 23:57:25,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:25,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:25,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:25,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:25,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416608210] [2024-11-09 23:57:25,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416608210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:25,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:25,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:57:25,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612745659] [2024-11-09 23:57:25,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:25,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:57:25,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:25,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:57:25,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:57:25,335 INFO L87 Difference]: Start difference. First operand 211 states and 267 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:25,582 INFO L93 Difference]: Finished difference Result 317 states and 417 transitions. [2024-11-09 23:57:25,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:57:25,582 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-11-09 23:57:25,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:25,583 INFO L225 Difference]: With dead ends: 317 [2024-11-09 23:57:25,583 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 23:57:25,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:57:25,584 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 716 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:25,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 624 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 23:57:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 193. [2024-11-09 23:57:25,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 190 states have (on average 1.3) internal successors, (247), 192 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 247 transitions. [2024-11-09 23:57:25,590 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 247 transitions. Word has length 54 [2024-11-09 23:57:25,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:25,590 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 247 transitions. [2024-11-09 23:57:25,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:25,590 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 247 transitions. [2024-11-09 23:57:25,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:25,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:25,591 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:25,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:57:25,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:25,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:25,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1269700239, now seen corresponding path program 1 times [2024-11-09 23:57:25,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:25,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179636683] [2024-11-09 23:57:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:26,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179636683] [2024-11-09 23:57:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179636683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 23:57:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781893602] [2024-11-09 23:57:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:26,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:57:26,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:57:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:57:26,214 INFO L87 Difference]: Start difference. First operand 193 states and 247 transitions. Second operand has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:27,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:27,076 INFO L93 Difference]: Finished difference Result 311 states and 411 transitions. [2024-11-09 23:57:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:57:27,080 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:27,081 INFO L225 Difference]: With dead ends: 311 [2024-11-09 23:57:27,081 INFO L226 Difference]: Without dead ends: 299 [2024-11-09 23:57:27,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-11-09 23:57:27,082 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 382 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1800 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:27,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1800 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:57:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-09 23:57:27,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 181. [2024-11-09 23:57:27,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 179 states have (on average 1.312849162011173) internal successors, (235), 180 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2024-11-09 23:57:27,089 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 55 [2024-11-09 23:57:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:27,089 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2024-11-09 23:57:27,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.235294117647059) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2024-11-09 23:57:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:27,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:27,089 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:27,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:57:27,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:27,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:27,090 INFO L85 PathProgramCache]: Analyzing trace with hash 972035950, now seen corresponding path program 1 times [2024-11-09 23:57:27,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:27,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237296360] [2024-11-09 23:57:27,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:27,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:27,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:27,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:27,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237296360] [2024-11-09 23:57:27,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237296360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:27,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:27,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-09 23:57:27,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282519763] [2024-11-09 23:57:27,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:27,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:57:27,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:27,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:57:27,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:57:27,565 INFO L87 Difference]: Start difference. First operand 181 states and 235 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:28,147 INFO L93 Difference]: Finished difference Result 411 states and 554 transitions. [2024-11-09 23:57:28,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 23:57:28,148 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:28,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:28,149 INFO L225 Difference]: With dead ends: 411 [2024-11-09 23:57:28,149 INFO L226 Difference]: Without dead ends: 405 [2024-11-09 23:57:28,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:57:28,150 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 768 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:28,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1470 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 23:57:28,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-09 23:57:28,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 175. [2024-11-09 23:57:28,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.30635838150289) internal successors, (226), 174 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 226 transitions. [2024-11-09 23:57:28,154 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 226 transitions. Word has length 55 [2024-11-09 23:57:28,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:28,154 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 226 transitions. [2024-11-09 23:57:28,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 15 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,154 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 226 transitions. [2024-11-09 23:57:28,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 23:57:28,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:28,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] [2024-11-09 23:57:28,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:57:28,155 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:28,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:28,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1861659525, now seen corresponding path program 1 times [2024-11-09 23:57:28,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:28,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852108012] [2024-11-09 23:57:28,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:28,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852108012] [2024-11-09 23:57:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852108012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:57:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995451847] [2024-11-09 23:57:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:57:28,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:28,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:57:28,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:57:28,482 INFO L87 Difference]: Start difference. First operand 175 states and 226 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:28,853 INFO L93 Difference]: Finished difference Result 293 states and 393 transitions. [2024-11-09 23:57:28,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:57:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 23:57:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:28,854 INFO L225 Difference]: With dead ends: 293 [2024-11-09 23:57:28,854 INFO L226 Difference]: Without dead ends: 287 [2024-11-09 23:57:28,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:57:28,855 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 478 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:28,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1042 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:28,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-09 23:57:28,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 169. [2024-11-09 23:57:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 168 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 220 transitions. [2024-11-09 23:57:28,858 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 220 transitions. Word has length 55 [2024-11-09 23:57:28,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:28,858 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 220 transitions. [2024-11-09 23:57:28,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 12 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,859 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 220 transitions. [2024-11-09 23:57:28,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 23:57:28,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:28,859 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] [2024-11-09 23:57:28,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:57:28,860 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:28,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:28,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1630171543, now seen corresponding path program 1 times [2024-11-09 23:57:28,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:28,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108699868] [2024-11-09 23:57:28,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:28,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:28,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:28,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108699868] [2024-11-09 23:57:28,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108699868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:28,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:28,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:28,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093124029] [2024-11-09 23:57:28,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:28,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:28,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:28,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:28,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:28,921 INFO L87 Difference]: Start difference. First operand 169 states and 220 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:28,973 INFO L93 Difference]: Finished difference Result 721 states and 1036 transitions. [2024-11-09 23:57:28,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:57:28,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-09 23:57:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:28,975 INFO L225 Difference]: With dead ends: 721 [2024-11-09 23:57:28,975 INFO L226 Difference]: Without dead ends: 629 [2024-11-09 23:57:28,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:57:28,976 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 515 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:28,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 542 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:28,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-09 23:57:28,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 259. [2024-11-09 23:57:28,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 258 states have (on average 1.3604651162790697) internal successors, (351), 258 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 351 transitions. [2024-11-09 23:57:28,981 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 351 transitions. Word has length 72 [2024-11-09 23:57:28,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:28,981 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 351 transitions. [2024-11-09 23:57:28,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:28,982 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 351 transitions. [2024-11-09 23:57:28,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:57:28,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:28,982 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] [2024-11-09 23:57:28,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:57:28,982 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:28,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:28,983 INFO L85 PathProgramCache]: Analyzing trace with hash -792842034, now seen corresponding path program 1 times [2024-11-09 23:57:28,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:28,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878863057] [2024-11-09 23:57:28,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:28,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878863057] [2024-11-09 23:57:29,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878863057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:29,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107353152] [2024-11-09 23:57:29,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:29,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:29,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:29,044 INFO L87 Difference]: Start difference. First operand 259 states and 351 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,103 INFO L93 Difference]: Finished difference Result 897 states and 1284 transitions. [2024-11-09 23:57:29,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:29,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 23:57:29,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,106 INFO L225 Difference]: With dead ends: 897 [2024-11-09 23:57:29,106 INFO L226 Difference]: Without dead ends: 715 [2024-11-09 23:57:29,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:29,107 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 303 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 458 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-09 23:57:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 439. [2024-11-09 23:57:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 438 states have (on average 1.404109589041096) internal successors, (615), 438 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 615 transitions. [2024-11-09 23:57:29,115 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 615 transitions. Word has length 74 [2024-11-09 23:57:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,115 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 615 transitions. [2024-11-09 23:57:29,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 615 transitions. [2024-11-09 23:57:29,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 23:57:29,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,116 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] [2024-11-09 23:57:29,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:57:29,116 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1648765613, now seen corresponding path program 1 times [2024-11-09 23:57:29,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481932217] [2024-11-09 23:57:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481932217] [2024-11-09 23:57:29,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481932217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:29,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796004054] [2024-11-09 23:57:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:29,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:29,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:29,182 INFO L87 Difference]: Start difference. First operand 439 states and 615 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,227 INFO L93 Difference]: Finished difference Result 1077 states and 1548 transitions. [2024-11-09 23:57:29,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:29,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-11-09 23:57:29,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,230 INFO L225 Difference]: With dead ends: 1077 [2024-11-09 23:57:29,230 INFO L226 Difference]: Without dead ends: 895 [2024-11-09 23:57:29,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:29,231 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 311 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 477 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:29,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-11-09 23:57:29,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 709. [2024-11-09 23:57:29,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.426553672316384) internal successors, (1010), 708 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1010 transitions. [2024-11-09 23:57:29,239 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1010 transitions. Word has length 74 [2024-11-09 23:57:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,240 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1010 transitions. [2024-11-09 23:57:29,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,240 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1010 transitions. [2024-11-09 23:57:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:57:29,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,241 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] [2024-11-09 23:57:29,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:57:29,241 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1929823592, now seen corresponding path program 1 times [2024-11-09 23:57:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921009966] [2024-11-09 23:57:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921009966] [2024-11-09 23:57:29,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921009966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:29,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50968047] [2024-11-09 23:57:29,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:29,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:29,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:29,281 INFO L87 Difference]: Start difference. First operand 709 states and 1010 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,301 INFO L93 Difference]: Finished difference Result 1877 states and 2698 transitions. [2024-11-09 23:57:29,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:29,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-09 23:57:29,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,305 INFO L225 Difference]: With dead ends: 1877 [2024-11-09 23:57:29,305 INFO L226 Difference]: Without dead ends: 1245 [2024-11-09 23:57:29,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:29,306 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 85 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 214 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:29,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-11-09 23:57:29,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1229. [2024-11-09 23:57:29,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1228 states have (on average 1.4014657980456027) internal successors, (1721), 1228 states have internal predecessors, (1721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1721 transitions. [2024-11-09 23:57:29,320 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1721 transitions. Word has length 75 [2024-11-09 23:57:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,320 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1721 transitions. [2024-11-09 23:57:29,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1721 transitions. [2024-11-09 23:57:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:57:29,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,321 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] [2024-11-09 23:57:29,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 23:57:29,321 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1547495254, now seen corresponding path program 1 times [2024-11-09 23:57:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965288257] [2024-11-09 23:57:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965288257] [2024-11-09 23:57:29,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965288257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 23:57:29,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617462279] [2024-11-09 23:57:29,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:57:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:57:29,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 23:57:29,381 INFO L87 Difference]: Start difference. First operand 1229 states and 1721 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,425 INFO L93 Difference]: Finished difference Result 2221 states and 3135 transitions. [2024-11-09 23:57:29,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:57:29,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-09 23:57:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,429 INFO L225 Difference]: With dead ends: 2221 [2024-11-09 23:57:29,430 INFO L226 Difference]: Without dead ends: 1891 [2024-11-09 23:57:29,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:29,433 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 306 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 492 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-09 23:57:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1557. [2024-11-09 23:57:29,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1556 states have (on average 1.4055269922879177) internal successors, (2187), 1556 states have internal predecessors, (2187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2187 transitions. [2024-11-09 23:57:29,457 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2187 transitions. Word has length 75 [2024-11-09 23:57:29,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,457 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2187 transitions. [2024-11-09 23:57:29,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2187 transitions. [2024-11-09 23:57:29,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 23:57:29,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,459 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] [2024-11-09 23:57:29,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 23:57:29,459 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,459 INFO L85 PathProgramCache]: Analyzing trace with hash -273860512, now seen corresponding path program 1 times [2024-11-09 23:57:29,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446737345] [2024-11-09 23:57:29,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446737345] [2024-11-09 23:57:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446737345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982539104] [2024-11-09 23:57:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:29,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:29,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:29,496 INFO L87 Difference]: Start difference. First operand 1557 states and 2187 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,519 INFO L93 Difference]: Finished difference Result 3039 states and 4291 transitions. [2024-11-09 23:57:29,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:29,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-09 23:57:29,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,523 INFO L225 Difference]: With dead ends: 3039 [2024-11-09 23:57:29,523 INFO L226 Difference]: Without dead ends: 1559 [2024-11-09 23:57:29,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:29,525 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 56 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 218 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-09 23:57:29,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1557. [2024-11-09 23:57:29,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1556 states have (on average 1.3991002570694087) internal successors, (2177), 1556 states have internal predecessors, (2177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2177 transitions. [2024-11-09 23:57:29,550 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2177 transitions. Word has length 75 [2024-11-09 23:57:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,550 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 2177 transitions. [2024-11-09 23:57:29,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2177 transitions. [2024-11-09 23:57:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 23:57:29,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,552 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] [2024-11-09 23:57:29,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 23:57:29,552 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1131427886, now seen corresponding path program 1 times [2024-11-09 23:57:29,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957850723] [2024-11-09 23:57:29,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957850723] [2024-11-09 23:57:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957850723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450193804] [2024-11-09 23:57:29,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:29,644 INFO L87 Difference]: Start difference. First operand 1557 states and 2177 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:29,787 INFO L93 Difference]: Finished difference Result 5183 states and 7387 transitions. [2024-11-09 23:57:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:57:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 23:57:29,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:29,795 INFO L225 Difference]: With dead ends: 5183 [2024-11-09 23:57:29,796 INFO L226 Difference]: Without dead ends: 3703 [2024-11-09 23:57:29,798 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:29,798 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 578 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:29,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 293 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:29,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3703 states. [2024-11-09 23:57:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3703 to 2891. [2024-11-09 23:57:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2891 states, 2890 states have (on average 1.4017301038062284) internal successors, (4051), 2890 states have internal predecessors, (4051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2891 states to 2891 states and 4051 transitions. [2024-11-09 23:57:29,833 INFO L78 Accepts]: Start accepts. Automaton has 2891 states and 4051 transitions. Word has length 76 [2024-11-09 23:57:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:29,833 INFO L471 AbstractCegarLoop]: Abstraction has 2891 states and 4051 transitions. [2024-11-09 23:57:29,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 2891 states and 4051 transitions. [2024-11-09 23:57:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:57:29,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:29,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:29,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 23:57:29,834 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:29,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:29,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1664810074, now seen corresponding path program 1 times [2024-11-09 23:57:29,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:29,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870822818] [2024-11-09 23:57:29,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:29,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:29,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:29,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:29,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870822818] [2024-11-09 23:57:29,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870822818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:29,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:29,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:29,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630201455] [2024-11-09 23:57:29,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:29,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:29,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:29,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:29,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:29,912 INFO L87 Difference]: Start difference. First operand 2891 states and 4051 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:30,046 INFO L93 Difference]: Finished difference Result 8105 states and 11355 transitions. [2024-11-09 23:57:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 23:57:30,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 23:57:30,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:30,058 INFO L225 Difference]: With dead ends: 8105 [2024-11-09 23:57:30,058 INFO L226 Difference]: Without dead ends: 5291 [2024-11-09 23:57:30,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:57:30,062 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 617 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:30,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 226 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:30,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2024-11-09 23:57:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 3993. [2024-11-09 23:57:30,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3993 states, 3992 states have (on average 1.37249498997996) internal successors, (5479), 3992 states have internal predecessors, (5479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3993 states to 3993 states and 5479 transitions. [2024-11-09 23:57:30,115 INFO L78 Accepts]: Start accepts. Automaton has 3993 states and 5479 transitions. Word has length 77 [2024-11-09 23:57:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:30,115 INFO L471 AbstractCegarLoop]: Abstraction has 3993 states and 5479 transitions. [2024-11-09 23:57:30,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3993 states and 5479 transitions. [2024-11-09 23:57:30,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-09 23:57:30,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:30,116 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 23:57:30,116 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash 2101740956, now seen corresponding path program 1 times [2024-11-09 23:57:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183242600] [2024-11-09 23:57:30,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:30,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:30,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:30,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183242600] [2024-11-09 23:57:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183242600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:30,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:30,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537706954] [2024-11-09 23:57:30,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:30,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:57:30,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:30,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:57:30,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:57:30,192 INFO L87 Difference]: Start difference. First operand 3993 states and 5479 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:30,360 INFO L93 Difference]: Finished difference Result 12905 states and 17889 transitions. [2024-11-09 23:57:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:57:30,361 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-11-09 23:57:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:30,393 INFO L225 Difference]: With dead ends: 12905 [2024-11-09 23:57:30,394 INFO L226 Difference]: Without dead ends: 8989 [2024-11-09 23:57:30,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:57:30,399 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 656 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:30,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 247 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:57:30,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-11-09 23:57:30,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8447. [2024-11-09 23:57:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8447 states, 8446 states have (on average 1.3768647880653564) internal successors, (11629), 8446 states have internal predecessors, (11629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8447 states to 8447 states and 11629 transitions. [2024-11-09 23:57:30,523 INFO L78 Accepts]: Start accepts. Automaton has 8447 states and 11629 transitions. Word has length 77 [2024-11-09 23:57:30,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:30,523 INFO L471 AbstractCegarLoop]: Abstraction has 8447 states and 11629 transitions. [2024-11-09 23:57:30,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,524 INFO L276 IsEmpty]: Start isEmpty. Operand 8447 states and 11629 transitions. [2024-11-09 23:57:30,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 23:57:30,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:30,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:30,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 23:57:30,525 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:30,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:30,526 INFO L85 PathProgramCache]: Analyzing trace with hash 602486906, now seen corresponding path program 1 times [2024-11-09 23:57:30,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:30,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299714487] [2024-11-09 23:57:30,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:30,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:30,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:30,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299714487] [2024-11-09 23:57:30,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299714487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:30,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:30,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958990619] [2024-11-09 23:57:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:30,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:30,559 INFO L87 Difference]: Start difference. First operand 8447 states and 11629 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:30,602 INFO L93 Difference]: Finished difference Result 17187 states and 23675 transitions. [2024-11-09 23:57:30,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:30,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 23:57:30,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:30,615 INFO L225 Difference]: With dead ends: 17187 [2024-11-09 23:57:30,615 INFO L226 Difference]: Without dead ends: 8817 [2024-11-09 23:57:30,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:30,624 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:30,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 293 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8817 states. [2024-11-09 23:57:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8817 to 8655. [2024-11-09 23:57:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8655 states, 8654 states have (on average 1.3562514444187659) internal successors, (11737), 8654 states have internal predecessors, (11737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8655 states to 8655 states and 11737 transitions. [2024-11-09 23:57:30,718 INFO L78 Accepts]: Start accepts. Automaton has 8655 states and 11737 transitions. Word has length 78 [2024-11-09 23:57:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:30,718 INFO L471 AbstractCegarLoop]: Abstraction has 8655 states and 11737 transitions. [2024-11-09 23:57:30,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 8655 states and 11737 transitions. [2024-11-09 23:57:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 23:57:30,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:30,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:30,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 23:57:30,720 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1242523234, now seen corresponding path program 1 times [2024-11-09 23:57:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:30,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172521966] [2024-11-09 23:57:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:30,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:30,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172521966] [2024-11-09 23:57:30,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172521966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:30,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:30,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:30,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639118386] [2024-11-09 23:57:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:30,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:30,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:30,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:30,782 INFO L87 Difference]: Start difference. First operand 8655 states and 11737 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:30,819 INFO L93 Difference]: Finished difference Result 16563 states and 22383 transitions. [2024-11-09 23:57:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-11-09 23:57:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:30,831 INFO L225 Difference]: With dead ends: 16563 [2024-11-09 23:57:30,831 INFO L226 Difference]: Without dead ends: 7985 [2024-11-09 23:57:30,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:30,839 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 59 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:30,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 269 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:30,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7985 states. [2024-11-09 23:57:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7985 to 6689. [2024-11-09 23:57:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6689 states, 6688 states have (on average 1.3379186602870814) internal successors, (8948), 6688 states have internal predecessors, (8948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 8948 transitions. [2024-11-09 23:57:30,959 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 8948 transitions. Word has length 78 [2024-11-09 23:57:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:30,959 INFO L471 AbstractCegarLoop]: Abstraction has 6689 states and 8948 transitions. [2024-11-09 23:57:30,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 8948 transitions. [2024-11-09 23:57:30,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-09 23:57:30,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:30,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 23:57:30,961 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:30,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash 234415952, now seen corresponding path program 1 times [2024-11-09 23:57:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:30,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793294744] [2024-11-09 23:57:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:31,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:31,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793294744] [2024-11-09 23:57:31,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793294744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:31,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:31,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:31,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180801141] [2024-11-09 23:57:31,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:31,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:31,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:31,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:31,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,036 INFO L87 Difference]: Start difference. First operand 6689 states and 8948 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:31,072 INFO L93 Difference]: Finished difference Result 15747 states and 21144 transitions. [2024-11-09 23:57:31,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:31,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-09 23:57:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:31,084 INFO L225 Difference]: With dead ends: 15747 [2024-11-09 23:57:31,085 INFO L226 Difference]: Without dead ends: 9135 [2024-11-09 23:57:31,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,092 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 47 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:31,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 269 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:31,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9135 states. [2024-11-09 23:57:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9135 to 8357. [2024-11-09 23:57:31,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8357 states, 8356 states have (on average 1.3368836764001915) internal successors, (11171), 8356 states have internal predecessors, (11171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8357 states to 8357 states and 11171 transitions. [2024-11-09 23:57:31,177 INFO L78 Accepts]: Start accepts. Automaton has 8357 states and 11171 transitions. Word has length 79 [2024-11-09 23:57:31,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:31,178 INFO L471 AbstractCegarLoop]: Abstraction has 8357 states and 11171 transitions. [2024-11-09 23:57:31,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,178 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states and 11171 transitions. [2024-11-09 23:57:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-09 23:57:31,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:31,179 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:31,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 23:57:31,179 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:31,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1356679024, now seen corresponding path program 1 times [2024-11-09 23:57:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:31,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779000656] [2024-11-09 23:57:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:31,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:31,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:31,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779000656] [2024-11-09 23:57:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779000656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:57:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255699940] [2024-11-09 23:57:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:31,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:57:31,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:31,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:57:31,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:57:31,364 INFO L87 Difference]: Start difference. First operand 8357 states and 11171 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:31,396 INFO L93 Difference]: Finished difference Result 8599 states and 11460 transitions. [2024-11-09 23:57:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 23:57:31,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-11-09 23:57:31,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:31,408 INFO L225 Difference]: With dead ends: 8599 [2024-11-09 23:57:31,408 INFO L226 Difference]: Without dead ends: 8597 [2024-11-09 23:57:31,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:57:31,412 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:31,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 624 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8597 states. [2024-11-09 23:57:31,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8597 to 8597. [2024-11-09 23:57:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8597 states, 8596 states have (on average 1.320497906002792) internal successors, (11351), 8596 states have internal predecessors, (11351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8597 states to 8597 states and 11351 transitions. [2024-11-09 23:57:31,493 INFO L78 Accepts]: Start accepts. Automaton has 8597 states and 11351 transitions. Word has length 80 [2024-11-09 23:57:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:31,494 INFO L471 AbstractCegarLoop]: Abstraction has 8597 states and 11351 transitions. [2024-11-09 23:57:31,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 8597 states and 11351 transitions. [2024-11-09 23:57:31,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 23:57:31,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:31,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:31,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-09 23:57:31,496 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1153042524, now seen corresponding path program 1 times [2024-11-09 23:57:31,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:31,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300554302] [2024-11-09 23:57:31,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:31,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:31,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-09 23:57:31,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:31,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300554302] [2024-11-09 23:57:31,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300554302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:31,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:31,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:31,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530901844] [2024-11-09 23:57:31,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:31,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:31,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:31,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:31,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,570 INFO L87 Difference]: Start difference. First operand 8597 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:31,607 INFO L93 Difference]: Finished difference Result 17921 states and 23553 transitions. [2024-11-09 23:57:31,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:31,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-11-09 23:57:31,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:31,621 INFO L225 Difference]: With dead ends: 17921 [2024-11-09 23:57:31,621 INFO L226 Difference]: Without dead ends: 9401 [2024-11-09 23:57:31,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,630 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 63 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:31,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 275 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2024-11-09 23:57:31,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 9095. [2024-11-09 23:57:31,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9095 states, 9094 states have (on average 1.288212007917308) internal successors, (11715), 9094 states have internal predecessors, (11715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9095 states to 9095 states and 11715 transitions. [2024-11-09 23:57:31,760 INFO L78 Accepts]: Start accepts. Automaton has 9095 states and 11715 transitions. Word has length 81 [2024-11-09 23:57:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:31,760 INFO L471 AbstractCegarLoop]: Abstraction has 9095 states and 11715 transitions. [2024-11-09 23:57:31,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 9095 states and 11715 transitions. [2024-11-09 23:57:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:57:31,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:31,763 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:31,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-09 23:57:31,764 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:31,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1396811091, now seen corresponding path program 1 times [2024-11-09 23:57:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:31,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688157551] [2024-11-09 23:57:31,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:31,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:31,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:31,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688157551] [2024-11-09 23:57:31,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688157551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:31,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:57:31,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:57:31,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024067521] [2024-11-09 23:57:31,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:31,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:57:31,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:31,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:57:31,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,852 INFO L87 Difference]: Start difference. First operand 9095 states and 11715 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:31,899 INFO L93 Difference]: Finished difference Result 17431 states and 22245 transitions. [2024-11-09 23:57:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:57:31,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-09 23:57:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:31,912 INFO L225 Difference]: With dead ends: 17431 [2024-11-09 23:57:31,912 INFO L226 Difference]: Without dead ends: 8413 [2024-11-09 23:57:31,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:57:31,921 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 54 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:31,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 246 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:57:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8413 states. [2024-11-09 23:57:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8413 to 8363. [2024-11-09 23:57:32,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8363 states, 8362 states have (on average 1.2443195407797178) internal successors, (10405), 8362 states have internal predecessors, (10405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8363 states to 8363 states and 10405 transitions. [2024-11-09 23:57:32,034 INFO L78 Accepts]: Start accepts. Automaton has 8363 states and 10405 transitions. Word has length 103 [2024-11-09 23:57:32,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:32,034 INFO L471 AbstractCegarLoop]: Abstraction has 8363 states and 10405 transitions. [2024-11-09 23:57:32,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 8363 states and 10405 transitions. [2024-11-09 23:57:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:57:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:32,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:32,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 23:57:32,037 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:32,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 736215482, now seen corresponding path program 1 times [2024-11-09 23:57:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418925594] [2024-11-09 23:57:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:32,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:32,256 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:32,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418925594] [2024-11-09 23:57:32,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418925594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:32,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029392948] [2024-11-09 23:57:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:32,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:32,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:32,258 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:32,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:57:32,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:32,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:57:32,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:33,052 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:33,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:33,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029392948] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:33,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:33,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2024-11-09 23:57:33,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294894447] [2024-11-09 23:57:33,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:33,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 23:57:33,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:33,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 23:57:33,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 23:57:33,859 INFO L87 Difference]: Start difference. First operand 8363 states and 10405 transitions. Second operand has 24 states, 24 states have (on average 10.666666666666666) internal successors, (256), 23 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:35,178 INFO L93 Difference]: Finished difference Result 42659 states and 52920 transitions. [2024-11-09 23:57:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 23:57:35,179 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 10.666666666666666) internal successors, (256), 23 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 23:57:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:35,236 INFO L225 Difference]: With dead ends: 42659 [2024-11-09 23:57:35,236 INFO L226 Difference]: Without dead ends: 34373 [2024-11-09 23:57:35,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=839, Invalid=2821, Unknown=0, NotChecked=0, Total=3660 [2024-11-09 23:57:35,253 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 1771 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:35,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 1142 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 23:57:35,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34373 states. [2024-11-09 23:57:35,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34373 to 17933. [2024-11-09 23:57:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17933 states, 17932 states have (on average 1.2350546509034128) internal successors, (22147), 17932 states have internal predecessors, (22147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17933 states to 17933 states and 22147 transitions. [2024-11-09 23:57:35,494 INFO L78 Accepts]: Start accepts. Automaton has 17933 states and 22147 transitions. Word has length 104 [2024-11-09 23:57:35,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:35,494 INFO L471 AbstractCegarLoop]: Abstraction has 17933 states and 22147 transitions. [2024-11-09 23:57:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.666666666666666) internal successors, (256), 23 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 17933 states and 22147 transitions. [2024-11-09 23:57:35,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:57:35,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:35,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:35,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:57:35,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 23:57:35,700 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:35,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 289199386, now seen corresponding path program 1 times [2024-11-09 23:57:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:35,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74466974] [2024-11-09 23:57:35,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:35,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:35,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74466974] [2024-11-09 23:57:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74466974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:36,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360879823] [2024-11-09 23:57:36,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:36,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:36,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:36,145 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:36,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:57:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:36,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 23:57:36,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:36,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:37,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360879823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:37,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:37,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 28 [2024-11-09 23:57:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665364815] [2024-11-09 23:57:37,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:37,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 23:57:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 23:57:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2024-11-09 23:57:37,378 INFO L87 Difference]: Start difference. First operand 17933 states and 22147 transitions. Second operand has 28 states, 28 states have (on average 10.178571428571429) internal successors, (285), 28 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:45,045 INFO L93 Difference]: Finished difference Result 111375 states and 137443 transitions. [2024-11-09 23:57:45,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2024-11-09 23:57:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 10.178571428571429) internal successors, (285), 28 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2024-11-09 23:57:45,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:45,196 INFO L225 Difference]: With dead ends: 111375 [2024-11-09 23:57:45,196 INFO L226 Difference]: Without dead ends: 93533 [2024-11-09 23:57:45,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16368 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=6280, Invalid=35950, Unknown=0, NotChecked=0, Total=42230 [2024-11-09 23:57:45,228 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 5710 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5710 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:45,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5710 Valid, 1772 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:57:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93533 states. [2024-11-09 23:57:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93533 to 64090. [2024-11-09 23:57:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64090 states, 64089 states have (on average 1.2362339871116728) internal successors, (79229), 64089 states have internal predecessors, (79229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:46,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64090 states to 64090 states and 79229 transitions. [2024-11-09 23:57:46,213 INFO L78 Accepts]: Start accepts. Automaton has 64090 states and 79229 transitions. Word has length 104 [2024-11-09 23:57:46,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:46,214 INFO L471 AbstractCegarLoop]: Abstraction has 64090 states and 79229 transitions. [2024-11-09 23:57:46,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.178571428571429) internal successors, (285), 28 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:46,214 INFO L276 IsEmpty]: Start isEmpty. Operand 64090 states and 79229 transitions. [2024-11-09 23:57:46,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:57:46,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:46,223 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:46,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:57:46,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 23:57:46,429 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1617665159, now seen corresponding path program 1 times [2024-11-09 23:57:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73666266] [2024-11-09 23:57:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:46,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:47,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73666266] [2024-11-09 23:57:47,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73666266] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:47,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694281463] [2024-11-09 23:57:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:47,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:47,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:47,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:47,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:57:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:47,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 23:57:47,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-09 23:57:47,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:57:47,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694281463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:57:47,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:57:47,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [19] total 26 [2024-11-09 23:57:47,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870850540] [2024-11-09 23:57:47,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:57:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:57:47,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:57:47,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:57:47,653 INFO L87 Difference]: Start difference. First operand 64090 states and 79229 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:57:48,301 INFO L93 Difference]: Finished difference Result 154853 states and 191431 transitions. [2024-11-09 23:57:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:57:48,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-09 23:57:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:57:48,415 INFO L225 Difference]: With dead ends: 154853 [2024-11-09 23:57:48,415 INFO L226 Difference]: Without dead ends: 90870 [2024-11-09 23:57:48,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1056, Unknown=0, NotChecked=0, Total=1190 [2024-11-09 23:57:48,467 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 386 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:57:48,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 513 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 23:57:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90870 states. [2024-11-09 23:57:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90870 to 64090. [2024-11-09 23:57:49,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64090 states, 64089 states have (on average 1.2361715739050383) internal successors, (79225), 64089 states have internal predecessors, (79225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64090 states to 64090 states and 79225 transitions. [2024-11-09 23:57:49,417 INFO L78 Accepts]: Start accepts. Automaton has 64090 states and 79225 transitions. Word has length 105 [2024-11-09 23:57:49,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:57:49,417 INFO L471 AbstractCegarLoop]: Abstraction has 64090 states and 79225 transitions. [2024-11-09 23:57:49,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 8 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:57:49,418 INFO L276 IsEmpty]: Start isEmpty. Operand 64090 states and 79225 transitions. [2024-11-09 23:57:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:57:49,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:57:49,422 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:57:49,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:57:49,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:49,627 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:57:49,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:57:49,627 INFO L85 PathProgramCache]: Analyzing trace with hash -2016059526, now seen corresponding path program 1 times [2024-11-09 23:57:49,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:57:49,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372152540] [2024-11-09 23:57:49,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:49,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:57:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:50,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:57:50,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372152540] [2024-11-09 23:57:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372152540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:57:50,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27964416] [2024-11-09 23:57:50,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:57:50,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:57:50,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:57:50,040 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:57:50,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:57:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:57:50,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 23:57:50,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:57:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:52,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:57:54,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:57:54,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27964416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:57:54,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:57:54,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 40 [2024-11-09 23:57:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76271124] [2024-11-09 23:57:54,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:57:54,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 23:57:54,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:57:54,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 23:57:54,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1444, Unknown=0, NotChecked=0, Total=1560 [2024-11-09 23:57:54,557 INFO L87 Difference]: Start difference. First operand 64090 states and 79225 transitions. Second operand has 40 states, 40 states have (on average 7.2) internal successors, (288), 40 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:25,398 INFO L93 Difference]: Finished difference Result 324940 states and 403175 transitions. [2024-11-09 23:58:25,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2024-11-09 23:58:25,400 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 7.2) internal successors, (288), 40 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2024-11-09 23:58:25,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:25,766 INFO L225 Difference]: With dead ends: 324940 [2024-11-09 23:58:25,766 INFO L226 Difference]: Without dead ends: 283875 [2024-11-09 23:58:25,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21811 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=5646, Invalid=54624, Unknown=0, NotChecked=0, Total=60270 [2024-11-09 23:58:25,806 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 6181 mSDsluCounter, 4166 mSDsCounter, 0 mSdLazyCounter, 7916 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6181 SdHoareTripleChecker+Valid, 4342 SdHoareTripleChecker+Invalid, 8121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 7916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:25,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6181 Valid, 4342 Invalid, 8121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 7916 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-09 23:58:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283875 states. [2024-11-09 23:58:27,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283875 to 109460. [2024-11-09 23:58:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109460 states, 109459 states have (on average 1.2328543107464895) internal successors, (134947), 109459 states have internal predecessors, (134947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:27,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109460 states to 109460 states and 134947 transitions. [2024-11-09 23:58:27,533 INFO L78 Accepts]: Start accepts. Automaton has 109460 states and 134947 transitions. Word has length 106 [2024-11-09 23:58:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:27,535 INFO L471 AbstractCegarLoop]: Abstraction has 109460 states and 134947 transitions. [2024-11-09 23:58:27,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.2) internal successors, (288), 40 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 109460 states and 134947 transitions. [2024-11-09 23:58:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:58:27,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:27,539 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:27,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 23:58:27,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 23:58:27,740 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:58:27,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -624746285, now seen corresponding path program 1 times [2024-11-09 23:58:27,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:27,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552172034] [2024-11-09 23:58:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:27,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:58:27,797 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 23:58:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:58:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552172034] [2024-11-09 23:58:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552172034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:58:27,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:58:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 23:58:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595648372] [2024-11-09 23:58:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:58:27,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:58:27,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:58:27,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:58:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:27,800 INFO L87 Difference]: Start difference. First operand 109460 states and 134947 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:58:28,089 INFO L93 Difference]: Finished difference Result 165669 states and 202737 transitions. [2024-11-09 23:58:28,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:58:28,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2024-11-09 23:58:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:58:28,148 INFO L225 Difference]: With dead ends: 165669 [2024-11-09 23:58:28,148 INFO L226 Difference]: Without dead ends: 56326 [2024-11-09 23:58:28,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 23:58:28,199 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 49 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:58:28,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 225 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:58:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56326 states. [2024-11-09 23:58:29,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56326 to 52460. [2024-11-09 23:58:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52460 states, 52459 states have (on average 1.1960197487561715) internal successors, (62742), 52459 states have internal predecessors, (62742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:29,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52460 states to 52460 states and 62742 transitions. [2024-11-09 23:58:29,771 INFO L78 Accepts]: Start accepts. Automaton has 52460 states and 62742 transitions. Word has length 107 [2024-11-09 23:58:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:58:29,771 INFO L471 AbstractCegarLoop]: Abstraction has 52460 states and 62742 transitions. [2024-11-09 23:58:29,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 23:58:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 52460 states and 62742 transitions. [2024-11-09 23:58:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:58:29,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:58:29,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:58:29,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-09 23:58:29,775 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-09 23:58:29,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:58:29,775 INFO L85 PathProgramCache]: Analyzing trace with hash -316105934, now seen corresponding path program 1 times [2024-11-09 23:58:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:58:29,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234307134] [2024-11-09 23:58:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:58:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:58:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat