./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-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 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:54:03,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:54:03,155 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:54:03,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:54:03,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:54:03,184 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:54:03,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:54:03,185 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:54:03,185 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:54:03,186 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:54:03,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:54:03,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:54:03,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:54:03,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:54:03,187 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:54:03,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:54:03,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:54:03,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:54:03,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:54:03,188 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:54:03,188 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:54:03,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:54:03,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:54:03,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:54:03,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:54:03,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:54:03,190 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:54:03,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:54:03,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:54:03,190 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:54:03,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:54:03,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:54:03,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:54:03,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:54:03,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:54:03,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:54:03,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:54:03,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:54:03,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:54:03,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:54:03,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:54:03,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:54:03,193 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 -> 46dda72cbacea7804179bc67e21a7607713ae67e303b365119c911cce7c0e646 [2024-10-14 03:54:03,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:54:03,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:54:03,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:54:03,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:54:03,406 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:54:03,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:54:04,621 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:54:04,826 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:54:04,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:54:04,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b91b82e/75375252df37482c84b5b2681cec1a06/FLAG840d1d3b5 [2024-10-14 03:54:04,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12b91b82e/75375252df37482c84b5b2681cec1a06 [2024-10-14 03:54:04,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:54:04,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:54:04,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:54:04,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:54:04,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:54:04,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:54:04" (1/1) ... [2024-10-14 03:54:04,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c772bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:04, skipping insertion in model container [2024-10-14 03:54:04,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:54:04" (1/1) ... [2024-10-14 03:54:04,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:54:05,088 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2024-10-14 03:54:05,106 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2024-10-14 03:54:05,120 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2024-10-14 03:54:05,130 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2024-10-14 03:54:05,140 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2024-10-14 03:54:05,152 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2024-10-14 03:54:05,162 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2024-10-14 03:54:05,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:54:05,198 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:54:05,232 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[6199,6212] [2024-10-14 03:54:05,242 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[9205,9218] [2024-10-14 03:54:05,251 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[12265,12278] [2024-10-14 03:54:05,260 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[15172,15185] [2024-10-14 03:54:05,270 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[18387,18400] [2024-10-14 03:54:05,277 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[21499,21512] [2024-10-14 03:54:05,288 WARN L248 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.BOUNDED-6.pals.c.v+sep-reducer.c[24550,24563] [2024-10-14 03:54:05,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:54:05,327 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:54:05,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05 WrapperNode [2024-10-14 03:54:05,327 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:54:05,328 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:54:05,328 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:54:05,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:54:05,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,390 INFO L138 Inliner]: procedures = 22, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1435 [2024-10-14 03:54:05,391 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:54:05,391 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:54:05,391 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:54:05,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:54:05,400 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,429 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-10-14 03:54:05,429 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,453 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:54:05,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:54:05,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:54:05,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:54:05,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (1/1) ... [2024-10-14 03:54:05,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:54:05,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:54:05,522 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-10-14 03:54:05,525 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-10-14 03:54:05,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:54:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:54:05,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:54:05,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:54:05,740 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:54:05,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:54:06,501 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2024-10-14 03:54:06,501 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:54:06,536 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:54:06,537 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:54:06,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:54:06 BoogieIcfgContainer [2024-10-14 03:54:06,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:54:06,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:54:06,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:54:06,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:54:06,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:54:04" (1/3) ... [2024-10-14 03:54:06,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700ca0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:54:06, skipping insertion in model container [2024-10-14 03:54:06,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:54:05" (2/3) ... [2024-10-14 03:54:06,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700ca0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:54:06, skipping insertion in model container [2024-10-14 03:54:06,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:54:06" (3/3) ... [2024-10-14 03:54:06,546 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c.v+sep-reducer.c [2024-10-14 03:54:06,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:54:06,560 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2024-10-14 03:54:06,619 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:54:06,625 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;@d44fbd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:54:06,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-14 03:54:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:06,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 03:54:06,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:06,643 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-10-14 03:54:06,644 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:06,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:06,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1191779176, now seen corresponding path program 1 times [2024-10-14 03:54:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063363165] [2024-10-14 03:54:06,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:06,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:07,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:07,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063363165] [2024-10-14 03:54:07,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063363165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:07,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:07,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:54:07,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410188896] [2024-10-14 03:54:07,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:07,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:07,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:07,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:07,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:07,130 INFO L87 Difference]: Start difference. First operand has 277 states, 269 states have (on average 1.7992565055762082) internal successors, (484), 276 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 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-10-14 03:54:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:07,394 INFO L93 Difference]: Finished difference Result 387 states and 655 transitions. [2024-10-14 03:54:07,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:07,397 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-10-14 03:54:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:07,408 INFO L225 Difference]: With dead ends: 387 [2024-10-14 03:54:07,408 INFO L226 Difference]: Without dead ends: 243 [2024-10-14 03:54:07,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:54:07,417 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 1149 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:07,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 286 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-14 03:54:07,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2024-10-14 03:54:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 236 states have (on average 1.2669491525423728) internal successors, (299), 242 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 299 transitions. [2024-10-14 03:54:07,471 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 299 transitions. Word has length 47 [2024-10-14 03:54:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:07,472 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 299 transitions. [2024-10-14 03:54:07,472 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-10-14 03:54:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 299 transitions. [2024-10-14 03:54:07,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 03:54:07,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:07,475 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-10-14 03:54:07,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:54:07,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:07,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash 520818139, now seen corresponding path program 1 times [2024-10-14 03:54:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689070551] [2024-10-14 03:54:07,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:07,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689070551] [2024-10-14 03:54:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689070551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:54:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315228220] [2024-10-14 03:54:07,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:07,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:07,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:07,623 INFO L87 Difference]: Start difference. First operand 243 states and 299 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-10-14 03:54:07,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:07,747 INFO L93 Difference]: Finished difference Result 311 states and 386 transitions. [2024-10-14 03:54:07,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:07,747 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-10-14 03:54:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:07,748 INFO L225 Difference]: With dead ends: 311 [2024-10-14 03:54:07,750 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 03:54:07,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:54:07,751 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 638 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:07,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 142 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 03:54:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-14 03:54:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 178 states have (on average 1.2696629213483146) internal successors, (226), 184 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-10-14 03:54:07,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 226 transitions. [2024-10-14 03:54:07,763 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 226 transitions. Word has length 47 [2024-10-14 03:54:07,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:07,763 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 226 transitions. [2024-10-14 03:54:07,764 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-10-14 03:54:07,764 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 226 transitions. [2024-10-14 03:54:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-14 03:54:07,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:07,765 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-10-14 03:54:07,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:54:07,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash 45954227, now seen corresponding path program 1 times [2024-10-14 03:54:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559161641] [2024-10-14 03:54:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:07,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:07,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559161641] [2024-10-14 03:54:07,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559161641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:07,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:07,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:54:07,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550303838] [2024-10-14 03:54:07,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:07,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:07,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:07,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:07,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:07,878 INFO L87 Difference]: Start difference. First operand 185 states and 226 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-10-14 03:54:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:08,029 INFO L93 Difference]: Finished difference Result 353 states and 446 transitions. [2024-10-14 03:54:08,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:08,029 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-10-14 03:54:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:08,030 INFO L225 Difference]: With dead ends: 353 [2024-10-14 03:54:08,030 INFO L226 Difference]: Without dead ends: 250 [2024-10-14 03:54:08,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:54:08,032 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 794 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:08,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 197 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:08,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-10-14 03:54:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 225. [2024-10-14 03:54:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.3256880733944953) internal successors, (289), 224 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-10-14 03:54:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 289 transitions. [2024-10-14 03:54:08,050 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 289 transitions. Word has length 47 [2024-10-14 03:54:08,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:08,050 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 289 transitions. [2024-10-14 03:54:08,051 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-10-14 03:54:08,051 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 289 transitions. [2024-10-14 03:54:08,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:54:08,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:08,052 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-10-14 03:54:08,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:54:08,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:08,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:08,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1209610819, now seen corresponding path program 1 times [2024-10-14 03:54:08,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:08,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28265788] [2024-10-14 03:54:08,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:08,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28265788] [2024-10-14 03:54:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28265788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:54:08,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907794771] [2024-10-14 03:54:08,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:54:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:08,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:54:08,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:54:08,321 INFO L87 Difference]: Start difference. First operand 225 states and 289 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-10-14 03:54:08,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:08,531 INFO L93 Difference]: Finished difference Result 478 states and 629 transitions. [2024-10-14 03:54:08,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:54:08,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-10-14 03:54:08,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:08,533 INFO L225 Difference]: With dead ends: 478 [2024-10-14 03:54:08,533 INFO L226 Difference]: Without dead ends: 350 [2024-10-14 03:54:08,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:54:08,536 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 531 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:08,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 407 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-14 03:54:08,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 225. [2024-10-14 03:54:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.3211009174311927) internal successors, (288), 224 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-10-14 03:54:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 288 transitions. [2024-10-14 03:54:08,552 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 288 transitions. Word has length 49 [2024-10-14 03:54:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:08,552 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 288 transitions. [2024-10-14 03:54:08,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 6 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-10-14 03:54:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 288 transitions. [2024-10-14 03:54:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:54:08,553 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:08,553 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-10-14 03:54:08,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:54:08,553 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:08,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:08,553 INFO L85 PathProgramCache]: Analyzing trace with hash 754421757, now seen corresponding path program 1 times [2024-10-14 03:54:08,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:08,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581100023] [2024-10-14 03:54:08,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:08,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:08,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-10-14 03:54:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:08,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581100023] [2024-10-14 03:54:08,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581100023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938402656] [2024-10-14 03:54:08,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:08,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:08,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:08,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:08,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:08,800 INFO L87 Difference]: Start difference. First operand 225 states and 288 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-10-14 03:54:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:09,095 INFO L93 Difference]: Finished difference Result 375 states and 486 transitions. [2024-10-14 03:54:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:09,097 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-10-14 03:54:09,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:09,098 INFO L225 Difference]: With dead ends: 375 [2024-10-14 03:54:09,098 INFO L226 Difference]: Without dead ends: 369 [2024-10-14 03:54:09,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:54:09,099 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 825 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:09,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 502 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:09,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-14 03:54:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 225. [2024-10-14 03:54:09,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.31651376146789) internal successors, (287), 224 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-10-14 03:54:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 287 transitions. [2024-10-14 03:54:09,107 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 287 transitions. Word has length 49 [2024-10-14 03:54:09,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:09,108 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 287 transitions. [2024-10-14 03:54:09,108 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-10-14 03:54:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 287 transitions. [2024-10-14 03:54:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-14 03:54:09,109 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:09,109 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-10-14 03:54:09,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:54:09,110 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:09,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:09,111 INFO L85 PathProgramCache]: Analyzing trace with hash -175435075, now seen corresponding path program 1 times [2024-10-14 03:54:09,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:09,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990906277] [2024-10-14 03:54:09,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:09,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:09,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990906277] [2024-10-14 03:54:09,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990906277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:09,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:09,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221532498] [2024-10-14 03:54:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:09,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:09,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:09,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:09,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:09,334 INFO L87 Difference]: Start difference. First operand 225 states and 287 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-10-14 03:54:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:09,573 INFO L93 Difference]: Finished difference Result 375 states and 501 transitions. [2024-10-14 03:54:09,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:54:09,576 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-10-14 03:54:09,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:09,577 INFO L225 Difference]: With dead ends: 375 [2024-10-14 03:54:09,577 INFO L226 Difference]: Without dead ends: 272 [2024-10-14 03:54:09,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:54:09,578 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 415 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:09,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 528 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-10-14 03:54:09,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 225. [2024-10-14 03:54:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 218 states have (on average 1.311926605504587) internal successors, (286), 224 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-10-14 03:54:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 286 transitions. [2024-10-14 03:54:09,586 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 286 transitions. Word has length 49 [2024-10-14 03:54:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:09,586 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 286 transitions. [2024-10-14 03:54:09,586 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-10-14 03:54:09,586 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 286 transitions. [2024-10-14 03:54:09,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 03:54:09,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:09,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:09,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:54:09,587 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:09,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1893856322, now seen corresponding path program 1 times [2024-10-14 03:54:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002731186] [2024-10-14 03:54:09,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:10,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-10-14 03:54:10,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:10,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002731186] [2024-10-14 03:54:10,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002731186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:10,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:10,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:54:10,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143124251] [2024-10-14 03:54:10,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:10,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:54:10,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:54:10,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:54:10,016 INFO L87 Difference]: Start difference. First operand 225 states and 286 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:10,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:10,384 INFO L93 Difference]: Finished difference Result 352 states and 475 transitions. [2024-10-14 03:54:10,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:10,384 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-10-14 03:54:10,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:10,386 INFO L225 Difference]: With dead ends: 352 [2024-10-14 03:54:10,386 INFO L226 Difference]: Without dead ends: 256 [2024-10-14 03:54:10,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:54:10,387 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 825 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:10,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 762 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-14 03:54:10,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 213. [2024-10-14 03:54:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 207 states have (on average 1.3140096618357489) internal successors, (272), 212 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 272 transitions. [2024-10-14 03:54:10,393 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 272 transitions. Word has length 50 [2024-10-14 03:54:10,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:10,393 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 272 transitions. [2024-10-14 03:54:10,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:10,393 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 272 transitions. [2024-10-14 03:54:10,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:54:10,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:10,394 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-10-14 03:54:10,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:54:10,394 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:10,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:10,395 INFO L85 PathProgramCache]: Analyzing trace with hash 883237538, now seen corresponding path program 1 times [2024-10-14 03:54:10,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:10,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400331790] [2024-10-14 03:54:10,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:10,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:10,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:11,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:11,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400331790] [2024-10-14 03:54:11,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400331790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:11,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:11,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-14 03:54:11,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386205371] [2024-10-14 03:54:11,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:11,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 03:54:11,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:11,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 03:54:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:54:11,095 INFO L87 Difference]: Start difference. First operand 213 states and 272 transitions. Second operand has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 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-10-14 03:54:11,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:11,954 INFO L93 Difference]: Finished difference Result 445 states and 588 transitions. [2024-10-14 03:54:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 03:54:11,954 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 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-10-14 03:54:11,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:11,956 INFO L225 Difference]: With dead ends: 445 [2024-10-14 03:54:11,956 INFO L226 Difference]: Without dead ends: 441 [2024-10-14 03:54:11,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2024-10-14 03:54:11,957 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 951 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1911 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:11,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1911 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:54:11,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-14 03:54:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 217. [2024-10-14 03:54:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 211 states have (on average 1.3175355450236967) internal successors, (278), 216 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:11,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 278 transitions. [2024-10-14 03:54:11,962 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 278 transitions. Word has length 51 [2024-10-14 03:54:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 278 transitions. [2024-10-14 03:54:11,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 18 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-10-14 03:54:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 278 transitions. [2024-10-14 03:54:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-14 03:54:11,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:11,963 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-10-14 03:54:11,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:54:11,964 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:11,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:11,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1387229666, now seen corresponding path program 1 times [2024-10-14 03:54:11,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:11,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872813823] [2024-10-14 03:54:11,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:11,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:12,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872813823] [2024-10-14 03:54:12,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872813823] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:12,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:54:12,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131590373] [2024-10-14 03:54:12,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:12,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:54:12,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:12,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:54:12,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:54:12,395 INFO L87 Difference]: Start difference. First operand 217 states and 278 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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-10-14 03:54:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:12,946 INFO L93 Difference]: Finished difference Result 664 states and 897 transitions. [2024-10-14 03:54:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:54:12,946 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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-10-14 03:54:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:12,948 INFO L225 Difference]: With dead ends: 664 [2024-10-14 03:54:12,948 INFO L226 Difference]: Without dead ends: 576 [2024-10-14 03:54:12,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:54:12,950 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 915 mSDsluCounter, 1185 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 915 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:12,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [915 Valid, 1331 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:12,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2024-10-14 03:54:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 213. [2024-10-14 03:54:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.3125) internal successors, (273), 212 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:12,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 273 transitions. [2024-10-14 03:54:12,955 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 273 transitions. Word has length 51 [2024-10-14 03:54:12,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:12,956 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 273 transitions. [2024-10-14 03:54:12,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 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-10-14 03:54:12,956 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 273 transitions. [2024-10-14 03:54:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 03:54:12,956 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:12,956 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-10-14 03:54:12,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:54:12,957 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-10-14 03:54:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:12,959 INFO L85 PathProgramCache]: Analyzing trace with hash -715181555, now seen corresponding path program 1 times [2024-10-14 03:54:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000792020] [2024-10-14 03:54:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:13,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:13,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000792020] [2024-10-14 03:54:13,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000792020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:13,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:13,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 03:54:13,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767804216] [2024-10-14 03:54:13,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:13,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:54:13,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:13,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:54:13,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:54:13,476 INFO L87 Difference]: Start difference. First operand 213 states and 273 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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-10-14 03:54:13,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:13,971 INFO L93 Difference]: Finished difference Result 231 states and 289 transitions. [2024-10-14 03:54:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:54:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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-10-14 03:54:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:13,972 INFO L225 Difference]: With dead ends: 231 [2024-10-14 03:54:13,972 INFO L226 Difference]: Without dead ends: 214 [2024-10-14 03:54:13,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:54:13,973 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:13,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1307 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:13,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-14 03:54:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2024-10-14 03:54:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.3034825870646767) internal successors, (262), 204 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:13,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 262 transitions. [2024-10-14 03:54:13,977 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 262 transitions. Word has length 52 [2024-10-14 03:54:13,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:13,977 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 262 transitions. [2024-10-14 03:54:13,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 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-10-14 03:54:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 262 transitions. [2024-10-14 03:54:13,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:54:13,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:13,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:13,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:54:13,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:13,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:13,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1870868834, now seen corresponding path program 1 times [2024-10-14 03:54:13,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:13,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463075322] [2024-10-14 03:54:13,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:13,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:14,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:14,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:14,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463075322] [2024-10-14 03:54:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463075322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:14,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:14,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:14,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816571373] [2024-10-14 03:54:14,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:14,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:14,112 INFO L87 Difference]: Start difference. First operand 205 states and 262 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:14,378 INFO L93 Difference]: Finished difference Result 353 states and 457 transitions. [2024-10-14 03:54:14,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:54:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:14,379 INFO L225 Difference]: With dead ends: 353 [2024-10-14 03:54:14,379 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 03:54:14,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:54:14,380 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 702 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:14,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 477 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:14,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 03:54:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2024-10-14 03:54:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.2985074626865671) internal successors, (261), 204 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 261 transitions. [2024-10-14 03:54:14,384 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 261 transitions. Word has length 53 [2024-10-14 03:54:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:14,384 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 261 transitions. [2024-10-14 03:54:14,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,385 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 261 transitions. [2024-10-14 03:54:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:54:14,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:14,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:14,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:54:14,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:14,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:14,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1523929374, now seen corresponding path program 1 times [2024-10-14 03:54:14,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:14,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417304727] [2024-10-14 03:54:14,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:14,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:14,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:14,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417304727] [2024-10-14 03:54:14,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417304727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:14,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:14,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:14,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463692134] [2024-10-14 03:54:14,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:14,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:14,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:14,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:14,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:14,512 INFO L87 Difference]: Start difference. First operand 205 states and 261 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:14,732 INFO L93 Difference]: Finished difference Result 326 states and 429 transitions. [2024-10-14 03:54:14,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:14,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:54:14,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:14,733 INFO L225 Difference]: With dead ends: 326 [2024-10-14 03:54:14,733 INFO L226 Difference]: Without dead ends: 208 [2024-10-14 03:54:14,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:54:14,734 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 245 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:14,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 438 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-14 03:54:14,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2024-10-14 03:54:14,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.2885572139303483) internal successors, (259), 204 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 259 transitions. [2024-10-14 03:54:14,738 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 259 transitions. Word has length 53 [2024-10-14 03:54:14,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:14,738 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 259 transitions. [2024-10-14 03:54:14,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:14,738 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2024-10-14 03:54:14,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 03:54:14,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:14,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:54:14,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:14,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:14,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1841671298, now seen corresponding path program 1 times [2024-10-14 03:54:14,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:14,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725015913] [2024-10-14 03:54:14,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:14,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725015913] [2024-10-14 03:54:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725015913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441382271] [2024-10-14 03:54:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:14,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:14,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:14,860 INFO L87 Difference]: Start difference. First operand 205 states and 259 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:15,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:15,129 INFO L93 Difference]: Finished difference Result 353 states and 454 transitions. [2024-10-14 03:54:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:15,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-10-14 03:54:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:15,130 INFO L225 Difference]: With dead ends: 353 [2024-10-14 03:54:15,130 INFO L226 Difference]: Without dead ends: 345 [2024-10-14 03:54:15,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:54:15,131 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 353 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:15,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 784 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:15,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-14 03:54:15,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 205. [2024-10-14 03:54:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 201 states have (on average 1.2835820895522387) internal successors, (258), 204 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 258 transitions. [2024-10-14 03:54:15,136 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 258 transitions. Word has length 53 [2024-10-14 03:54:15,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:15,136 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 258 transitions. [2024-10-14 03:54:15,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 258 transitions. [2024-10-14 03:54:15,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:54:15,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:15,137 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-10-14 03:54:15,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:54:15,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:15,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1353414343, now seen corresponding path program 1 times [2024-10-14 03:54:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440904810] [2024-10-14 03:54:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440904810] [2024-10-14 03:54:15,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440904810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:15,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:15,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:54:15,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350646865] [2024-10-14 03:54:15,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:15,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:54:15,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:15,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:54:15,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:54:15,517 INFO L87 Difference]: Start difference. First operand 205 states and 258 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) 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-10-14 03:54:16,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:16,066 INFO L93 Difference]: Finished difference Result 562 states and 744 transitions. [2024-10-14 03:54:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:54:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-14 03:54:16,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:16,068 INFO L225 Difference]: With dead ends: 562 [2024-10-14 03:54:16,069 INFO L226 Difference]: Without dead ends: 556 [2024-10-14 03:54:16,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:54:16,070 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 676 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:16,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 1831 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:54:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-14 03:54:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 199. [2024-10-14 03:54:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 196 states have (on average 1.280612244897959) internal successors, (251), 198 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 251 transitions. [2024-10-14 03:54:16,075 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 251 transitions. Word has length 55 [2024-10-14 03:54:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:16,075 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 251 transitions. [2024-10-14 03:54:16,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) 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-10-14 03:54:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 251 transitions. [2024-10-14 03:54:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:54:16,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:16,076 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-10-14 03:54:16,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:54:16,076 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:16,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:16,077 INFO L85 PathProgramCache]: Analyzing trace with hash 635933575, now seen corresponding path program 1 times [2024-10-14 03:54:16,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:16,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466512819] [2024-10-14 03:54:16,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:16,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:16,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:16,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466512819] [2024-10-14 03:54:16,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466512819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:16,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:16,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 03:54:16,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277240086] [2024-10-14 03:54:16,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:16,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 03:54:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 03:54:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:54:16,431 INFO L87 Difference]: Start difference. First operand 199 states and 251 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-10-14 03:54:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:16,939 INFO L93 Difference]: Finished difference Result 237 states and 287 transitions. [2024-10-14 03:54:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:54:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-10-14 03:54:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:16,940 INFO L225 Difference]: With dead ends: 237 [2024-10-14 03:54:16,940 INFO L226 Difference]: Without dead ends: 228 [2024-10-14 03:54:16,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2024-10-14 03:54:16,941 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 308 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:16,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 1473 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:54:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-14 03:54:16,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 199. [2024-10-14 03:54:16,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 198 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:16,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 250 transitions. [2024-10-14 03:54:16,944 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 250 transitions. Word has length 55 [2024-10-14 03:54:16,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:16,944 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 250 transitions. [2024-10-14 03:54:16,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 16 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-10-14 03:54:16,945 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 250 transitions. [2024-10-14 03:54:16,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 03:54:16,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:16,945 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-10-14 03:54:16,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:54:16,945 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:16,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash -974454201, now seen corresponding path program 1 times [2024-10-14 03:54:16,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:16,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147996290] [2024-10-14 03:54:16,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:17,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147996290] [2024-10-14 03:54:17,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147996290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:17,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:17,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:54:17,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354284822] [2024-10-14 03:54:17,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:17,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:54:17,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:17,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:54:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:54:17,226 INFO L87 Difference]: Start difference. First operand 199 states and 250 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 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-10-14 03:54:17,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:17,469 INFO L93 Difference]: Finished difference Result 299 states and 392 transitions. [2024-10-14 03:54:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:54:17,469 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 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-10-14 03:54:17,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:17,470 INFO L225 Difference]: With dead ends: 299 [2024-10-14 03:54:17,470 INFO L226 Difference]: Without dead ends: 279 [2024-10-14 03:54:17,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-10-14 03:54:17,471 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 454 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:17,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 659 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:17,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-14 03:54:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 179. [2024-10-14 03:54:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 178 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 228 transitions. [2024-10-14 03:54:17,474 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 228 transitions. Word has length 55 [2024-10-14 03:54:17,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:17,474 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 228 transitions. [2024-10-14 03:54:17,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 10 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-10-14 03:54:17,474 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 228 transitions. [2024-10-14 03:54:17,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 03:54:17,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:17,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:17,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:54:17,474 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:17,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:17,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1825517588, now seen corresponding path program 1 times [2024-10-14 03:54:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:17,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293642757] [2024-10-14 03:54:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:17,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:17,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:17,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293642757] [2024-10-14 03:54:17,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293642757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:17,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:17,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:54:17,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347478828] [2024-10-14 03:54:17,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:17,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:54:17,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:17,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:54:17,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:54:17,775 INFO L87 Difference]: Start difference. First operand 179 states and 228 transitions. Second operand has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,047 INFO L93 Difference]: Finished difference Result 179 states and 228 transitions. [2024-10-14 03:54:18,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:54:18,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2024-10-14 03:54:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,049 INFO L225 Difference]: With dead ends: 179 [2024-10-14 03:54:18,049 INFO L226 Difference]: Without dead ends: 166 [2024-10-14 03:54:18,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:54:18,050 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 321 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 535 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:54:18,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-10-14 03:54:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-10-14 03:54:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.303030303030303) internal successors, (215), 165 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 215 transitions. [2024-10-14 03:54:18,052 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 215 transitions. Word has length 56 [2024-10-14 03:54:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,053 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 215 transitions. [2024-10-14 03:54:18,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.666666666666667) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,053 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 215 transitions. [2024-10-14 03:54:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:54:18,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,053 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-10-14 03:54:18,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:54:18,054 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:18,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,054 INFO L85 PathProgramCache]: Analyzing trace with hash 51586787, now seen corresponding path program 1 times [2024-10-14 03:54:18,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273812647] [2024-10-14 03:54:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273812647] [2024-10-14 03:54:18,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273812647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:54:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693794082] [2024-10-14 03:54:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:18,115 INFO L87 Difference]: Start difference. First operand 166 states and 215 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-10-14 03:54:18,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,167 INFO L93 Difference]: Finished difference Result 670 states and 971 transitions. [2024-10-14 03:54:18,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:54:18,168 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-10-14 03:54:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,169 INFO L225 Difference]: With dead ends: 670 [2024-10-14 03:54:18,169 INFO L226 Difference]: Without dead ends: 586 [2024-10-14 03:54:18,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:18,170 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 534 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 461 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2024-10-14 03:54:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 248. [2024-10-14 03:54:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.360323886639676) internal successors, (336), 247 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 336 transitions. [2024-10-14 03:54:18,175 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 336 transitions. Word has length 74 [2024-10-14 03:54:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,175 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 336 transitions. [2024-10-14 03:54:18,175 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-10-14 03:54:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 336 transitions. [2024-10-14 03:54:18,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:54:18,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,176 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-10-14 03:54:18,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:54:18,176 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:18,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1857068940, now seen corresponding path program 1 times [2024-10-14 03:54:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439348950] [2024-10-14 03:54:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439348950] [2024-10-14 03:54:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439348950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:54:18,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328572620] [2024-10-14 03:54:18,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:18,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:18,240 INFO L87 Difference]: Start difference. First operand 248 states and 336 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,283 INFO L93 Difference]: Finished difference Result 830 states and 1199 transitions. [2024-10-14 03:54:18,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:18,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,285 INFO L225 Difference]: With dead ends: 830 [2024-10-14 03:54:18,285 INFO L226 Difference]: Without dead ends: 664 [2024-10-14 03:54:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-14 03:54:18,286 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 296 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 415 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-14 03:54:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 412. [2024-10-14 03:54:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.4111922141119222) internal successors, (580), 411 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 580 transitions. [2024-10-14 03:54:18,292 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 580 transitions. Word has length 76 [2024-10-14 03:54:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 580 transitions. [2024-10-14 03:54:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 580 transitions. [2024-10-14 03:54:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:54:18,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,293 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-10-14 03:54:18,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:54:18,293 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-10-14 03:54:18,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1771586931, now seen corresponding path program 1 times [2024-10-14 03:54:18,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593967886] [2024-10-14 03:54:18,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593967886] [2024-10-14 03:54:18,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593967886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:18,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210883148] [2024-10-14 03:54:18,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:18,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:18,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:18,326 INFO L87 Difference]: Start difference. First operand 412 states and 580 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,365 INFO L93 Difference]: Finished difference Result 1020 states and 1470 transitions. [2024-10-14 03:54:18,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:18,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 03:54:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,367 INFO L225 Difference]: With dead ends: 1020 [2024-10-14 03:54:18,367 INFO L226 Difference]: Without dead ends: 690 [2024-10-14 03:54:18,368 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-10-14 03:54:18,368 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 288 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-14 03:54:18,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2024-10-14 03:54:18,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.4002911208151383) internal successors, (962), 687 states have internal predecessors, (962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 962 transitions. [2024-10-14 03:54:18,380 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 962 transitions. Word has length 76 [2024-10-14 03:54:18,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,380 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 962 transitions. [2024-10-14 03:54:18,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,381 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 962 transitions. [2024-10-14 03:54:18,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:54:18,383 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,383 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-10-14 03:54:18,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:54:18,384 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-10-14 03:54:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1838080443, now seen corresponding path program 1 times [2024-10-14 03:54:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879588030] [2024-10-14 03:54:18,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879588030] [2024-10-14 03:54:18,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879588030] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:18,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699126788] [2024-10-14 03:54:18,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:18,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:18,434 INFO L87 Difference]: Start difference. First operand 688 states and 962 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,458 INFO L93 Difference]: Finished difference Result 1296 states and 1836 transitions. [2024-10-14 03:54:18,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:18,458 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-10-14 03:54:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,460 INFO L225 Difference]: With dead ends: 1296 [2024-10-14 03:54:18,460 INFO L226 Difference]: Without dead ends: 690 [2024-10-14 03:54:18,461 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-10-14 03:54:18,461 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 51 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 207 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-10-14 03:54:18,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 207 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-14 03:54:18,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2024-10-14 03:54:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 1.3944687045123727) internal successors, (958), 687 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 958 transitions. [2024-10-14 03:54:18,474 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 958 transitions. Word has length 76 [2024-10-14 03:54:18,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,475 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 958 transitions. [2024-10-14 03:54:18,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 958 transitions. [2024-10-14 03:54:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:54:18,476 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,476 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-10-14 03:54:18,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:54:18,477 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-10-14 03:54:18,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1823220340, now seen corresponding path program 1 times [2024-10-14 03:54:18,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187720619] [2024-10-14 03:54:18,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187720619] [2024-10-14 03:54:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187720619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:54:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253744384] [2024-10-14 03:54:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:18,563 INFO L87 Difference]: Start difference. First operand 688 states and 958 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,614 INFO L93 Difference]: Finished difference Result 1754 states and 2486 transitions. [2024-10-14 03:54:18,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:18,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,619 INFO L225 Difference]: With dead ends: 1754 [2024-10-14 03:54:18,619 INFO L226 Difference]: Without dead ends: 1450 [2024-10-14 03:54:18,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-14 03:54:18,621 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 288 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 473 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2024-10-14 03:54:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1142. [2024-10-14 03:54:18,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.4075372480280455) internal successors, (1606), 1141 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1606 transitions. [2024-10-14 03:54:18,636 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1606 transitions. Word has length 76 [2024-10-14 03:54:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,636 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1606 transitions. [2024-10-14 03:54:18,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1606 transitions. [2024-10-14 03:54:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-14 03:54:18,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,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, 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-10-14 03:54:18,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:54:18,638 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-10-14 03:54:18,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,638 INFO L85 PathProgramCache]: Analyzing trace with hash 405281676, now seen corresponding path program 1 times [2024-10-14 03:54:18,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559506222] [2024-10-14 03:54:18,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559506222] [2024-10-14 03:54:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559506222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:54:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18534549] [2024-10-14 03:54:18,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:54:18,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:54:18,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:54:18,700 INFO L87 Difference]: Start difference. First operand 1142 states and 1606 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,744 INFO L93 Difference]: Finished difference Result 2056 states and 2918 transitions. [2024-10-14 03:54:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:54:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,749 INFO L225 Difference]: With dead ends: 2056 [2024-10-14 03:54:18,749 INFO L226 Difference]: Without dead ends: 1752 [2024-10-14 03:54:18,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-10-14 03:54:18,750 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 290 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 421 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2024-10-14 03:54:18,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1444. [2024-10-14 03:54:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1444 states, 1443 states have (on average 1.4123354123354124) internal successors, (2038), 1443 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2038 transitions. [2024-10-14 03:54:18,772 INFO L78 Accepts]: Start accepts. Automaton has 1444 states and 2038 transitions. Word has length 76 [2024-10-14 03:54:18,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,772 INFO L471 AbstractCegarLoop]: Abstraction has 1444 states and 2038 transitions. [2024-10-14 03:54:18,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 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-10-14 03:54:18,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1444 states and 2038 transitions. [2024-10-14 03:54:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:54:18,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,773 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-10-14 03:54:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:54:18,773 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-10-14 03:54:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,773 INFO L85 PathProgramCache]: Analyzing trace with hash -838790076, now seen corresponding path program 1 times [2024-10-14 03:54:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692934599] [2024-10-14 03:54:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692934599] [2024-10-14 03:54:18,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692934599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006037179] [2024-10-14 03:54:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:18,835 INFO L87 Difference]: Start difference. First operand 1444 states and 2038 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-14 03:54:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,858 INFO L93 Difference]: Finished difference Result 3682 states and 5214 transitions. [2024-10-14 03:54:18,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:18,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-14 03:54:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,864 INFO L225 Difference]: With dead ends: 3682 [2024-10-14 03:54:18,864 INFO L226 Difference]: Without dead ends: 2320 [2024-10-14 03:54:18,866 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-10-14 03:54:18,866 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 60 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 267 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2024-10-14 03:54:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2174. [2024-10-14 03:54:18,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2174 states, 2173 states have (on average 1.3943856419696272) internal successors, (3030), 2173 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 3030 transitions. [2024-10-14 03:54:18,895 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 3030 transitions. Word has length 77 [2024-10-14 03:54:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:18,895 INFO L471 AbstractCegarLoop]: Abstraction has 2174 states and 3030 transitions. [2024-10-14 03:54:18,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 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-10-14 03:54:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 3030 transitions. [2024-10-14 03:54:18,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:54:18,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:18,895 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-10-14 03:54:18,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:54:18,896 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-10-14 03:54:18,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -361763827, now seen corresponding path program 1 times [2024-10-14 03:54:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738647167] [2024-10-14 03:54:18,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:18,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:18,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:18,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738647167] [2024-10-14 03:54:18,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738647167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:18,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:18,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:18,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304749364] [2024-10-14 03:54:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:18,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:18,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:18,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:18,931 INFO L87 Difference]: Start difference. First operand 2174 states and 3030 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-10-14 03:54:18,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:18,955 INFO L93 Difference]: Finished difference Result 4350 states and 6087 transitions. [2024-10-14 03:54:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:18,955 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-10-14 03:54:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:18,960 INFO L225 Difference]: With dead ends: 4350 [2024-10-14 03:54:18,960 INFO L226 Difference]: Without dead ends: 2258 [2024-10-14 03:54:18,962 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-10-14 03:54:18,963 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 68 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:18,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 202 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2258 states. [2024-10-14 03:54:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2258 to 2256. [2024-10-14 03:54:19,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2256 states, 2255 states have (on average 1.3778270509977828) internal successors, (3107), 2255 states have internal predecessors, (3107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3107 transitions. [2024-10-14 03:54:19,017 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3107 transitions. Word has length 78 [2024-10-14 03:54:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:19,017 INFO L471 AbstractCegarLoop]: Abstraction has 2256 states and 3107 transitions. [2024-10-14 03:54:19,018 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-10-14 03:54:19,018 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3107 transitions. [2024-10-14 03:54:19,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:54:19,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:19,018 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-10-14 03:54:19,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:54:19,018 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-10-14 03:54:19,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1235003982, now seen corresponding path program 1 times [2024-10-14 03:54:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536034409] [2024-10-14 03:54:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:19,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:19,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:19,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536034409] [2024-10-14 03:54:19,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536034409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:19,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:19,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:19,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042738131] [2024-10-14 03:54:19,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:19,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:19,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:19,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:19,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:19,079 INFO L87 Difference]: Start difference. First operand 2256 states and 3107 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-10-14 03:54:19,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:19,104 INFO L93 Difference]: Finished difference Result 6380 states and 8751 transitions. [2024-10-14 03:54:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:19,105 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-10-14 03:54:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:19,114 INFO L225 Difference]: With dead ends: 6380 [2024-10-14 03:54:19,114 INFO L226 Difference]: Without dead ends: 4206 [2024-10-14 03:54:19,116 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-10-14 03:54:19,116 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 53 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:19,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 263 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2024-10-14 03:54:19,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3980. [2024-10-14 03:54:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3980 states, 3979 states have (on average 1.356119628047248) internal successors, (5396), 3979 states have internal predecessors, (5396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3980 states to 3980 states and 5396 transitions. [2024-10-14 03:54:19,170 INFO L78 Accepts]: Start accepts. Automaton has 3980 states and 5396 transitions. Word has length 78 [2024-10-14 03:54:19,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:19,170 INFO L471 AbstractCegarLoop]: Abstraction has 3980 states and 5396 transitions. [2024-10-14 03:54:19,170 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-10-14 03:54:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 3980 states and 5396 transitions. [2024-10-14 03:54:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:54:19,171 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:19,171 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-10-14 03:54:19,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:54:19,171 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-10-14 03:54:19,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:19,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1857807879, now seen corresponding path program 1 times [2024-10-14 03:54:19,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:19,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398612089] [2024-10-14 03:54:19,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:19,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:19,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:19,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398612089] [2024-10-14 03:54:19,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398612089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:19,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:19,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:54:19,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183269341] [2024-10-14 03:54:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:19,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:54:19,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:19,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:54:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:54:19,229 INFO L87 Difference]: Start difference. First operand 3980 states and 5396 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-10-14 03:54:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:19,265 INFO L93 Difference]: Finished difference Result 11328 states and 15226 transitions. [2024-10-14 03:54:19,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:54:19,265 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-10-14 03:54:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:19,289 INFO L225 Difference]: With dead ends: 11328 [2024-10-14 03:54:19,289 INFO L226 Difference]: Without dead ends: 7430 [2024-10-14 03:54:19,295 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-10-14 03:54:19,295 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 43 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:19,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 263 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7430 states. [2024-10-14 03:54:19,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7430 to 6980. [2024-10-14 03:54:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6980 states, 6979 states have (on average 1.3248316377704543) internal successors, (9246), 6979 states have internal predecessors, (9246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6980 states to 6980 states and 9246 transitions. [2024-10-14 03:54:19,389 INFO L78 Accepts]: Start accepts. Automaton has 6980 states and 9246 transitions. Word has length 79 [2024-10-14 03:54:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:19,389 INFO L471 AbstractCegarLoop]: Abstraction has 6980 states and 9246 transitions. [2024-10-14 03:54:19,389 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-10-14 03:54:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6980 states and 9246 transitions. [2024-10-14 03:54:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:54:19,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:19,390 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-10-14 03:54:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:54:19,390 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-10-14 03:54:19,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:19,390 INFO L85 PathProgramCache]: Analyzing trace with hash 123926530, now seen corresponding path program 1 times [2024-10-14 03:54:19,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:19,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738562394] [2024-10-14 03:54:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:19,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:19,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:19,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:19,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738562394] [2024-10-14 03:54:19,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738562394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:19,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:19,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:54:19,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755822422] [2024-10-14 03:54:19,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:54:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:54:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:54:19,543 INFO L87 Difference]: Start difference. First operand 6980 states and 9246 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-10-14 03:54:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:19,582 INFO L93 Difference]: Finished difference Result 7174 states and 9503 transitions. [2024-10-14 03:54:19,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:54:19,583 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-10-14 03:54:19,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:19,594 INFO L225 Difference]: With dead ends: 7174 [2024-10-14 03:54:19,594 INFO L226 Difference]: Without dead ends: 7172 [2024-10-14 03:54:19,597 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-10-14 03:54:19,597 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:19,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 601 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:54:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7172 states. [2024-10-14 03:54:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7172 to 7172. [2024-10-14 03:54:19,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7171 states have (on average 1.30497838516246) internal successors, (9358), 7171 states have internal predecessors, (9358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 9358 transitions. [2024-10-14 03:54:19,683 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 9358 transitions. Word has length 80 [2024-10-14 03:54:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:19,683 INFO L471 AbstractCegarLoop]: Abstraction has 7172 states and 9358 transitions. [2024-10-14 03:54:19,683 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-10-14 03:54:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 9358 transitions. [2024-10-14 03:54:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 03:54:19,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:19,685 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:19,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:54:19,685 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-10-14 03:54:19,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:19,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1385171760, now seen corresponding path program 1 times [2024-10-14 03:54:19,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:19,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745610263] [2024-10-14 03:54:19,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:19,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:19,844 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:54:19,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:19,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745610263] [2024-10-14 03:54:19,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745610263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:54:19,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:54:19,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:54:19,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717861767] [2024-10-14 03:54:19,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:54:19,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:54:19,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:19,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:54:19,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:54:19,847 INFO L87 Difference]: Start difference. First operand 7172 states and 9358 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:20,116 INFO L93 Difference]: Finished difference Result 21620 states and 28168 transitions. [2024-10-14 03:54:20,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:54:20,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 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 102 [2024-10-14 03:54:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:20,138 INFO L225 Difference]: With dead ends: 21620 [2024-10-14 03:54:20,138 INFO L226 Difference]: Without dead ends: 14516 [2024-10-14 03:54:20,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:54:20,149 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 378 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:20,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 482 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:54:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14516 states. [2024-10-14 03:54:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14516 to 7172. [2024-10-14 03:54:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 7171 states have (on average 1.3046994840329103) internal successors, (9356), 7171 states have internal predecessors, (9356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 9356 transitions. [2024-10-14 03:54:20,285 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 9356 transitions. Word has length 102 [2024-10-14 03:54:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 7172 states and 9356 transitions. [2024-10-14 03:54:20,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 9356 transitions. [2024-10-14 03:54:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 03:54:20,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:20,288 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:20,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:54:20,288 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-10-14 03:54:20,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:20,288 INFO L85 PathProgramCache]: Analyzing trace with hash 244910667, now seen corresponding path program 1 times [2024-10-14 03:54:20,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:20,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301492290] [2024-10-14 03:54:20,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:20,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:20,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301492290] [2024-10-14 03:54:20,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301492290] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:54:20,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645444819] [2024-10-14 03:54:20,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:20,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:54:20,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:54:20,614 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-10-14 03:54:20,615 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-10-14 03:54:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:20,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-14 03:54:20,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:54:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:21,649 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:54:22,657 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645444819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:54:22,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:54:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2024-10-14 03:54:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742762508] [2024-10-14 03:54:22,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:54:22,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 03:54:22,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:22,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 03:54:22,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:54:22,659 INFO L87 Difference]: Start difference. First operand 7172 states and 9356 transitions. Second operand has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:23,764 INFO L93 Difference]: Finished difference Result 28512 states and 37545 transitions. [2024-10-14 03:54:23,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:54:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 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-10-14 03:54:23,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:23,796 INFO L225 Difference]: With dead ends: 28512 [2024-10-14 03:54:23,796 INFO L226 Difference]: Without dead ends: 21422 [2024-10-14 03:54:23,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=535, Invalid=1721, Unknown=0, NotChecked=0, Total=2256 [2024-10-14 03:54:23,808 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 989 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 989 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:23,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [989 Valid, 913 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:54:23,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21422 states. [2024-10-14 03:54:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21422 to 17238. [2024-10-14 03:54:23,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17238 states, 17237 states have (on average 1.3044613331786274) internal successors, (22485), 17237 states have internal predecessors, (22485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17238 states to 17238 states and 22485 transitions. [2024-10-14 03:54:24,017 INFO L78 Accepts]: Start accepts. Automaton has 17238 states and 22485 transitions. Word has length 104 [2024-10-14 03:54:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:24,017 INFO L471 AbstractCegarLoop]: Abstraction has 17238 states and 22485 transitions. [2024-10-14 03:54:24,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.464285714285714) internal successors, (265), 27 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 17238 states and 22485 transitions. [2024-10-14 03:54:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:54:24,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:24,020 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:54:24,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:54:24,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:54:24,222 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-10-14 03:54:24,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -669561429, now seen corresponding path program 1 times [2024-10-14 03:54:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:24,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269482235] [2024-10-14 03:54:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:24,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269482235] [2024-10-14 03:54:24,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269482235] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:54:24,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182042522] [2024-10-14 03:54:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:24,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:54:24,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:54:24,593 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-10-14 03:54:24,599 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-10-14 03:54:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:24,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 03:54:24,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:54:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 03:54:24,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:54:25,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 03:54:25,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182042522] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:54:25,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:54:25,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 7] total 21 [2024-10-14 03:54:25,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32044220] [2024-10-14 03:54:25,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:54:25,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 03:54:25,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:25,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 03:54:25,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:54:25,413 INFO L87 Difference]: Start difference. First operand 17238 states and 22485 transitions. Second operand has 21 states, 21 states have (on average 14.19047619047619) internal successors, (298), 21 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-10-14 03:54:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:54:36,409 INFO L93 Difference]: Finished difference Result 445454 states and 590143 transitions. [2024-10-14 03:54:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 264 states. [2024-10-14 03:54:36,409 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 14.19047619047619) internal successors, (298), 21 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) Word has length 105 [2024-10-14 03:54:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:54:37,182 INFO L225 Difference]: With dead ends: 445454 [2024-10-14 03:54:37,182 INFO L226 Difference]: Without dead ends: 428328 [2024-10-14 03:54:37,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35735 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8058, Invalid=71184, Unknown=0, NotChecked=0, Total=79242 [2024-10-14 03:54:37,276 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 5234 mSDsluCounter, 3687 mSDsCounter, 0 mSdLazyCounter, 6324 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5234 SdHoareTripleChecker+Valid, 4098 SdHoareTripleChecker+Invalid, 6403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 6324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:54:37,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5234 Valid, 4098 Invalid, 6403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 6324 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 03:54:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428328 states. [2024-10-14 03:54:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428328 to 107374. [2024-10-14 03:54:40,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107374 states, 107373 states have (on average 1.3121734514263361) internal successors, (140892), 107373 states have internal predecessors, (140892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:54:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107374 states to 107374 states and 140892 transitions. [2024-10-14 03:54:40,499 INFO L78 Accepts]: Start accepts. Automaton has 107374 states and 140892 transitions. Word has length 105 [2024-10-14 03:54:40,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:54:40,500 INFO L471 AbstractCegarLoop]: Abstraction has 107374 states and 140892 transitions. [2024-10-14 03:54:40,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 14.19047619047619) internal successors, (298), 21 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-10-14 03:54:40,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107374 states and 140892 transitions. [2024-10-14 03:54:40,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 03:54:40,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:54:40,508 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 03:54:40,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:54:40,708 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,SelfDestructingSolverStorable30 [2024-10-14 03:54:40,709 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-10-14 03:54:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:54:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1006298418, now seen corresponding path program 1 times [2024-10-14 03:54:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:54:40,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169886607] [2024-10-14 03:54:40,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:54:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:54:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169886607] [2024-10-14 03:54:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169886607] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:54:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201170888] [2024-10-14 03:54:41,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:54:41,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:54:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:54:41,254 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-10-14 03:54:41,255 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-10-14 03:54:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:54:41,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 03:54:41,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:54:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:42,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:54:44,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:54:44,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201170888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:54:44,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:54:44,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 17] total 43 [2024-10-14 03:54:44,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602753407] [2024-10-14 03:54:44,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:54:44,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-14 03:54:44,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:54:44,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-14 03:54:44,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2024-10-14 03:54:44,023 INFO L87 Difference]: Start difference. First operand 107374 states and 140892 transitions. Second operand has 43 states, 43 states have (on average 6.6976744186046515) internal successors, (288), 43 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-10-14 03:55:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:55:20,951 INFO L93 Difference]: Finished difference Result 1320144 states and 1718865 transitions. [2024-10-14 03:55:20,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 314 states. [2024-10-14 03:55:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 6.6976744186046515) internal successors, (288), 43 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 105 [2024-10-14 03:55:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:55:23,970 INFO L225 Difference]: With dead ends: 1320144 [2024-10-14 03:55:23,971 INFO L226 Difference]: Without dead ends: 1212851 [2024-10-14 03:55:24,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 353 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51067 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=13243, Invalid=112427, Unknown=0, NotChecked=0, Total=125670 [2024-10-14 03:55:24,726 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 12771 mSDsluCounter, 3172 mSDsCounter, 0 mSdLazyCounter, 5615 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12771 SdHoareTripleChecker+Valid, 3285 SdHoareTripleChecker+Invalid, 6012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 5615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:55:24,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12771 Valid, 3285 Invalid, 6012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 5615 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 03:55:25,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212851 states.