./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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fc434c98d81d50ebbaaf1f0c0ad7b0d03fbdae2db606436a34b66c07c286ced --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 20:33:20,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 20:33:20,579 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 20:33:20,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 20:33:20,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 20:33:20,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 20:33:20,611 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 20:33:20,611 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 20:33:20,611 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 20:33:20,612 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 20:33:20,613 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 20:33:20,613 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 20:33:20,613 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 20:33:20,615 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 20:33:20,615 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 20:33:20,615 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 20:33:20,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 20:33:20,616 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 20:33:20,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 20:33:20,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 20:33:20,619 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 20:33:20,619 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 20:33:20,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 20:33:20,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 20:33:20,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 20:33:20,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 20:33:20,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:33:20,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 20:33:20,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 20:33:20,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 20:33:20,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 20:33:20,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 20:33:20,623 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 -> 9fc434c98d81d50ebbaaf1f0c0ad7b0d03fbdae2db606436a34b66c07c286ced [2024-10-12 20:33:20,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 20:33:20,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 20:33:20,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 20:33:20,830 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 20:33:20,831 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 20:33:20,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2024-10-12 20:33:22,004 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 20:33:22,493 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 20:33:22,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2024-10-12 20:33:22,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529be99ae/aa4b4a00925f4db4bb070c37f399f4bf/FLAGf4fe7f9a7 [2024-10-12 20:33:22,561 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/529be99ae/aa4b4a00925f4db4bb070c37f399f4bf [2024-10-12 20:33:22,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 20:33:22,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 20:33:22,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 20:33:22,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 20:33:22,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 20:33:22,573 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:33:22" (1/1) ... [2024-10-12 20:33:22,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590141ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:22, skipping insertion in model container [2024-10-12 20:33:22,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 08:33:22" (1/1) ... [2024-10-12 20:33:22,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 20:33:23,226 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[22358,22371] [2024-10-12 20:33:23,262 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[28268,28281] [2024-10-12 20:33:23,274 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[29690,29703] [2024-10-12 20:33:23,281 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[30548,30561] [2024-10-12 20:33:23,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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[32341,32354] [2024-10-12 20:33:23,294 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[33199,33212] [2024-10-12 20:33:23,302 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[34428,34441] [2024-10-12 20:33:23,320 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[37283,37296] [2024-10-12 20:33:23,327 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[38144,38157] [2024-10-12 20:33:23,336 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[39376,39389] [2024-10-12 20:33:23,352 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[41667,41680] [2024-10-12 20:33:23,370 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46092,46105] [2024-10-12 20:33:23,377 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46953,46966] [2024-10-12 20:33:23,382 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-12 20:33:23,392 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[50476,50489] [2024-10-12 20:33:23,405 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[54337,54350] [2024-10-12 20:33:23,434 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[61299,61312] [2024-10-12 20:33:23,439 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[62160,62173] [2024-10-12 20:33:23,444 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[63392,63405] [2024-10-12 20:33:23,455 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[65683,65696] [2024-10-12 20:33:23,492 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[69544,69557] [2024-10-12 20:33:23,513 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[75942,75955] [2024-10-12 20:33:23,556 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[87347,87360] [2024-10-12 20:33:23,565 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[88208,88221] [2024-10-12 20:33:23,570 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[89401,89414] [2024-10-12 20:33:23,579 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[91653,91666] [2024-10-12 20:33:23,593 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[95755,95768] [2024-10-12 20:33:23,617 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[103009,103022] [2024-10-12 20:33:23,666 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[115656,115669] [2024-10-12 20:33:23,751 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[137951,137964] [2024-10-12 20:33:23,756 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[138812,138825] [2024-10-12 20:33:23,762 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[140044,140057] [2024-10-12 20:33:23,770 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[142335,142348] [2024-10-12 20:33:23,783 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[146196,146209] [2024-10-12 20:33:23,803 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[152594,152607] [2024-10-12 20:33:23,832 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[163435,163448] [2024-10-12 20:33:23,881 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[182075,182088] [2024-10-12 20:33:24,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:33:24,880 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 20:33:24,967 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[22358,22371] [2024-10-12 20:33:24,979 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[28268,28281] [2024-10-12 20:33:24,984 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[29690,29703] [2024-10-12 20:33:24,987 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[30548,30561] [2024-10-12 20:33:24,992 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[32341,32354] [2024-10-12 20:33:24,997 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[33199,33212] [2024-10-12 20:33:25,006 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[34428,34441] [2024-10-12 20:33:25,014 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[37283,37296] [2024-10-12 20:33:25,018 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[38144,38157] [2024-10-12 20:33:25,022 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[39376,39389] [2024-10-12 20:33:25,030 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[41667,41680] [2024-10-12 20:33:25,040 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46092,46105] [2024-10-12 20:33:25,043 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[46953,46966] [2024-10-12 20:33:25,047 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[48185,48198] [2024-10-12 20:33:25,053 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[50476,50489] [2024-10-12 20:33:25,062 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[54337,54350] [2024-10-12 20:33:25,077 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[61299,61312] [2024-10-12 20:33:25,081 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[62160,62173] [2024-10-12 20:33:25,085 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[63392,63405] [2024-10-12 20:33:25,091 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[65683,65696] [2024-10-12 20:33:25,100 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[69544,69557] [2024-10-12 20:33:25,114 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[75942,75955] [2024-10-12 20:33:25,137 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[87347,87360] [2024-10-12 20:33:25,141 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[88208,88221] [2024-10-12 20:33:25,147 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[89401,89414] [2024-10-12 20:33:25,154 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[91653,91666] [2024-10-12 20:33:25,166 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[95755,95768] [2024-10-12 20:33:25,185 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[103009,103022] [2024-10-12 20:33:25,211 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[115656,115669] [2024-10-12 20:33:25,294 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[137951,137964] [2024-10-12 20:33:25,298 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[138812,138825] [2024-10-12 20:33:25,301 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[140044,140057] [2024-10-12 20:33:25,307 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[142335,142348] [2024-10-12 20:33:25,317 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[146196,146209] [2024-10-12 20:33:25,331 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[152594,152607] [2024-10-12 20:33:25,353 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[163435,163448] [2024-10-12 20:33:25,386 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.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c[182075,182088] [2024-10-12 20:33:26,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 20:33:26,154 INFO L204 MainTranslator]: Completed translation [2024-10-12 20:33:26,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26 WrapperNode [2024-10-12 20:33:26,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 20:33:26,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 20:33:26,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 20:33:26,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 20:33:26,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,546 INFO L138 Inliner]: procedures = 27, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25972 [2024-10-12 20:33:26,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 20:33:26,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 20:33:26,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 20:33:26,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 20:33:26,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,722 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-12 20:33:26,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,960 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:26,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:27,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 20:33:27,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 20:33:27,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 20:33:27,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 20:33:27,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (1/1) ... [2024-10-12 20:33:27,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 20:33:27,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 20:33:27,085 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-12 20:33:27,088 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-12 20:33:27,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 20:33:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 20:33:27,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 20:33:27,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 20:33:27,517 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 20:33:27,518 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 20:33:34,944 INFO L? ?]: Removed 4041 outVars from TransFormulas that were not future-live. [2024-10-12 20:33:34,944 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 20:33:35,073 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 20:33:35,073 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-12 20:33:35,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:33:35 BoogieIcfgContainer [2024-10-12 20:33:35,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 20:33:35,075 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 20:33:35,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 20:33:35,078 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 20:33:35,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 08:33:22" (1/3) ... [2024-10-12 20:33:35,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bd399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:33:35, skipping insertion in model container [2024-10-12 20:33:35,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 08:33:26" (2/3) ... [2024-10-12 20:33:35,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0bd399 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:33:35, skipping insertion in model container [2024-10-12 20:33:35,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:33:35" (3/3) ... [2024-10-12 20:33:35,081 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.1.ufo.BOUNDED-16.pals.c.v+lhb-reducer.c [2024-10-12 20:33:35,093 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 20:33:35,093 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2024-10-12 20:33:35,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 20:33:35,210 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;@31e17bd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 20:33:35,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2024-10-12 20:33:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 3891 states, 3853 states have (on average 1.866337918505061) internal successors, (7191), 3890 states have internal predecessors, (7191), 0 states have call successors, (0), 0 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-12 20:33:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 20:33:35,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:35,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:35,268 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash 970242633, now seen corresponding path program 1 times [2024-10-12 20:33:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235231654] [2024-10-12 20:33:35,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:35,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:36,068 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-12 20:33:36,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:36,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235231654] [2024-10-12 20:33:36,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235231654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:36,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:36,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:36,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491524688] [2024-10-12 20:33:36,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:36,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:36,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:36,109 INFO L87 Difference]: Start difference. First operand has 3891 states, 3853 states have (on average 1.866337918505061) internal successors, (7191), 3890 states have internal predecessors, (7191), 0 states have call successors, (0), 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 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-12 20:33:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:38,279 INFO L93 Difference]: Finished difference Result 5677 states and 10167 transitions. [2024-10-12 20:33:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:38,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2024-10-12 20:33:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:38,311 INFO L225 Difference]: With dead ends: 5677 [2024-10-12 20:33:38,311 INFO L226 Difference]: Without dead ends: 3057 [2024-10-12 20:33:38,322 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-12 20:33:38,326 INFO L432 NwaCegarLoop]: 3342 mSDtfsCounter, 16025 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2092 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16025 SdHoareTripleChecker+Valid, 3446 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 2092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:38,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16025 Valid, 3446 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 2092 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:33:38,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3057 states. [2024-10-12 20:33:38,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3057 to 3057. [2024-10-12 20:33:38,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3057 states, 3020 states have (on average 1.3119205298013246) internal successors, (3962), 3056 states have internal predecessors, (3962), 0 states have call successors, (0), 0 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-12 20:33:38,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3057 states to 3057 states and 3962 transitions. [2024-10-12 20:33:38,456 INFO L78 Accepts]: Start accepts. Automaton has 3057 states and 3962 transitions. Word has length 116 [2024-10-12 20:33:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:38,457 INFO L471 AbstractCegarLoop]: Abstraction has 3057 states and 3962 transitions. [2024-10-12 20:33:38,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 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-12 20:33:38,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3057 states and 3962 transitions. [2024-10-12 20:33:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 20:33:38,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:38,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:38,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 20:33:38,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:38,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash 716802334, now seen corresponding path program 1 times [2024-10-12 20:33:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:38,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352651131] [2024-10-12 20:33:38,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:38,762 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-12 20:33:38,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:38,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352651131] [2024-10-12 20:33:38,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352651131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:38,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:38,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348799181] [2024-10-12 20:33:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:38,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:38,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:38,767 INFO L87 Difference]: Start difference. First operand 3057 states and 3962 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-12 20:33:40,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:40,022 INFO L93 Difference]: Finished difference Result 4837 states and 6520 transitions. [2024-10-12 20:33:40,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:40,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 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 117 [2024-10-12 20:33:40,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:40,034 INFO L225 Difference]: With dead ends: 4837 [2024-10-12 20:33:40,034 INFO L226 Difference]: Without dead ends: 2461 [2024-10-12 20:33:40,037 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-12 20:33:40,037 INFO L432 NwaCegarLoop]: 1854 mSDtfsCounter, 9807 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9807 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:40,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9807 Valid, 1874 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 20:33:40,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2024-10-12 20:33:40,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2461. [2024-10-12 20:33:40,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 2424 states have (on average 1.3617986798679869) internal successors, (3301), 2460 states have internal predecessors, (3301), 0 states have call successors, (0), 0 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-12 20:33:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 3301 transitions. [2024-10-12 20:33:40,067 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 3301 transitions. Word has length 117 [2024-10-12 20:33:40,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:40,067 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 3301 transitions. [2024-10-12 20:33:40,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 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-12 20:33:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 3301 transitions. [2024-10-12 20:33:40,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 20:33:40,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:40,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:33:40,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 20:33:40,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:40,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:40,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1403949894, now seen corresponding path program 1 times [2024-10-12 20:33:40,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:40,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140945038] [2024-10-12 20:33:40,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:40,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:40,353 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-12 20:33:40,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140945038] [2024-10-12 20:33:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140945038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835046983] [2024-10-12 20:33:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:40,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:40,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:40,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:40,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:40,358 INFO L87 Difference]: Start difference. First operand 2461 states and 3301 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-12 20:33:41,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:41,725 INFO L93 Difference]: Finished difference Result 4241 states and 5858 transitions. [2024-10-12 20:33:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:41,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 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 118 [2024-10-12 20:33:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:41,731 INFO L225 Difference]: With dead ends: 4241 [2024-10-12 20:33:41,731 INFO L226 Difference]: Without dead ends: 2301 [2024-10-12 20:33:41,734 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-12 20:33:41,734 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 9060 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 1840 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9060 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 1993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:41,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9060 Valid, 1330 Invalid, 1993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1840 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 20:33:41,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2024-10-12 20:33:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2301. [2024-10-12 20:33:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2301 states, 2264 states have (on average 1.372791519434629) internal successors, (3108), 2300 states have internal predecessors, (3108), 0 states have call successors, (0), 0 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-12 20:33:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2301 states to 2301 states and 3108 transitions. [2024-10-12 20:33:41,768 INFO L78 Accepts]: Start accepts. Automaton has 2301 states and 3108 transitions. Word has length 118 [2024-10-12 20:33:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:41,768 INFO L471 AbstractCegarLoop]: Abstraction has 2301 states and 3108 transitions. [2024-10-12 20:33:41,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 4 states have internal predecessors, (118), 0 states have call successors, (0), 0 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-12 20:33:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2301 states and 3108 transitions. [2024-10-12 20:33:41,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 20:33:41,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:41,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 20:33:41,772 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1175064949, now seen corresponding path program 1 times [2024-10-12 20:33:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281959133] [2024-10-12 20:33:41,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:41,967 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-12 20:33:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281959133] [2024-10-12 20:33:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281959133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:41,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546753780] [2024-10-12 20:33:41,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:41,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:41,969 INFO L87 Difference]: Start difference. First operand 2301 states and 3108 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:43,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:43,000 INFO L93 Difference]: Finished difference Result 4081 states and 5664 transitions. [2024-10-12 20:33:43,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:43,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-10-12 20:33:43,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:43,006 INFO L225 Difference]: With dead ends: 4081 [2024-10-12 20:33:43,006 INFO L226 Difference]: Without dead ends: 2125 [2024-10-12 20:33:43,008 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-12 20:33:43,008 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 8590 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8590 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:43,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8590 Valid, 1542 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 20:33:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-10-12 20:33:43,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 2125. [2024-10-12 20:33:43,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2125 states, 2088 states have (on average 1.3960727969348659) internal successors, (2915), 2124 states have internal predecessors, (2915), 0 states have call successors, (0), 0 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-12 20:33:43,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2915 transitions. [2024-10-12 20:33:43,032 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2915 transitions. Word has length 119 [2024-10-12 20:33:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:43,032 INFO L471 AbstractCegarLoop]: Abstraction has 2125 states and 2915 transitions. [2024-10-12 20:33:43,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 4 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:43,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2915 transitions. [2024-10-12 20:33:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 20:33:43,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:43,035 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:43,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 20:33:43,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:43,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:43,036 INFO L85 PathProgramCache]: Analyzing trace with hash -454932709, now seen corresponding path program 1 times [2024-10-12 20:33:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:43,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857851830] [2024-10-12 20:33:43,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:43,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:43,210 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-12 20:33:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857851830] [2024-10-12 20:33:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857851830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:43,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:43,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:43,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204882205] [2024-10-12 20:33:43,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:43,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:43,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:43,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:43,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:43,213 INFO L87 Difference]: Start difference. First operand 2125 states and 2915 transitions. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-12 20:33:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:44,038 INFO L93 Difference]: Finished difference Result 3905 states and 5470 transitions. [2024-10-12 20:33:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-10-12 20:33:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:44,043 INFO L225 Difference]: With dead ends: 3905 [2024-10-12 20:33:44,043 INFO L226 Difference]: Without dead ends: 2001 [2024-10-12 20:33:44,045 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-12 20:33:44,046 INFO L432 NwaCegarLoop]: 1502 mSDtfsCounter, 8235 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8235 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:44,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8235 Valid, 1530 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:33:44,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2001 states. [2024-10-12 20:33:44,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2001 to 2001. [2024-10-12 20:33:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2001 states, 1964 states have (on average 1.4164969450101832) internal successors, (2782), 2000 states have internal predecessors, (2782), 0 states have call successors, (0), 0 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-12 20:33:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2001 states to 2001 states and 2782 transitions. [2024-10-12 20:33:44,069 INFO L78 Accepts]: Start accepts. Automaton has 2001 states and 2782 transitions. Word has length 120 [2024-10-12 20:33:44,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:44,069 INFO L471 AbstractCegarLoop]: Abstraction has 2001 states and 2782 transitions. [2024-10-12 20:33:44,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 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-12 20:33:44,069 INFO L276 IsEmpty]: Start isEmpty. Operand 2001 states and 2782 transitions. [2024-10-12 20:33:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 20:33:44,072 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:44,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:44,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 20:33:44,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:44,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:44,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2030592158, now seen corresponding path program 1 times [2024-10-12 20:33:44,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:44,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55032125] [2024-10-12 20:33:44,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:44,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:44,249 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-12 20:33:44,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:44,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55032125] [2024-10-12 20:33:44,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55032125] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:44,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:44,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:44,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82494503] [2024-10-12 20:33:44,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:44,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:44,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:44,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:44,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:44,251 INFO L87 Difference]: Start difference. First operand 2001 states and 2782 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-12 20:33:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:45,130 INFO L93 Difference]: Finished difference Result 3781 states and 5336 transitions. [2024-10-12 20:33:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:45,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-10-12 20:33:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:45,135 INFO L225 Difference]: With dead ends: 3781 [2024-10-12 20:33:45,135 INFO L226 Difference]: Without dead ends: 1927 [2024-10-12 20:33:45,136 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-12 20:33:45,137 INFO L432 NwaCegarLoop]: 1482 mSDtfsCounter, 8025 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8025 SdHoareTripleChecker+Valid, 1494 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:45,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8025 Valid, 1494 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 20:33:45,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2024-10-12 20:33:45,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927. [2024-10-12 20:33:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1890 states have (on average 1.4301587301587302) internal successors, (2703), 1926 states have internal predecessors, (2703), 0 states have call successors, (0), 0 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-12 20:33:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2703 transitions. [2024-10-12 20:33:45,160 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2703 transitions. Word has length 121 [2024-10-12 20:33:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:45,160 INFO L471 AbstractCegarLoop]: Abstraction has 1927 states and 2703 transitions. [2024-10-12 20:33:45,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 0 states have call successors, (0), 0 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-12 20:33:45,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2703 transitions. [2024-10-12 20:33:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 20:33:45,163 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:45,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:45,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 20:33:45,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:45,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 541891792, now seen corresponding path program 1 times [2024-10-12 20:33:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225588247] [2024-10-12 20:33:45,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:45,323 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-12 20:33:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225588247] [2024-10-12 20:33:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225588247] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:45,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242707696] [2024-10-12 20:33:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:45,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:45,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:45,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:45,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:45,325 INFO L87 Difference]: Start difference. First operand 1927 states and 2703 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-12 20:33:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:46,798 INFO L93 Difference]: Finished difference Result 4721 states and 6682 transitions. [2024-10-12 20:33:46,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:46,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-12 20:33:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:46,805 INFO L225 Difference]: With dead ends: 4721 [2024-10-12 20:33:46,806 INFO L226 Difference]: Without dead ends: 2901 [2024-10-12 20:33:46,807 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-12 20:33:46,808 INFO L432 NwaCegarLoop]: 1465 mSDtfsCounter, 10757 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10757 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 1843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:46,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10757 Valid, 2254 Invalid, 1843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:33:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2024-10-12 20:33:46,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2775. [2024-10-12 20:33:46,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2738 states have (on average 1.4558071585098613) internal successors, (3986), 2774 states have internal predecessors, (3986), 0 states have call successors, (0), 0 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-12 20:33:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3986 transitions. [2024-10-12 20:33:46,854 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3986 transitions. Word has length 122 [2024-10-12 20:33:46,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:46,854 INFO L471 AbstractCegarLoop]: Abstraction has 2775 states and 3986 transitions. [2024-10-12 20:33:46,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 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-12 20:33:46,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3986 transitions. [2024-10-12 20:33:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 20:33:46,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:46,860 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:46,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 20:33:46,860 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:46,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash -965925399, now seen corresponding path program 1 times [2024-10-12 20:33:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:46,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122002681] [2024-10-12 20:33:46,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:46,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:47,013 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-12 20:33:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:47,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122002681] [2024-10-12 20:33:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122002681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:47,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:47,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 20:33:47,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625460796] [2024-10-12 20:33:47,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:47,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 20:33:47,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 20:33:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 20:33:47,015 INFO L87 Difference]: Start difference. First operand 2775 states and 3986 transitions. Second operand has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-12 20:33:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:47,989 INFO L93 Difference]: Finished difference Result 5443 states and 7864 transitions. [2024-10-12 20:33:47,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 20:33:47,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-10-12 20:33:47,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:47,995 INFO L225 Difference]: With dead ends: 5443 [2024-10-12 20:33:47,995 INFO L226 Difference]: Without dead ends: 2761 [2024-10-12 20:33:47,997 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-12 20:33:47,998 INFO L432 NwaCegarLoop]: 1412 mSDtfsCounter, 7803 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7803 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:47,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7803 Valid, 1448 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 20:33:48,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2024-10-12 20:33:48,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 2761. [2024-10-12 20:33:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4570484581497798) internal successors, (3969), 2760 states have internal predecessors, (3969), 0 states have call successors, (0), 0 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-12 20:33:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3969 transitions. [2024-10-12 20:33:48,032 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3969 transitions. Word has length 123 [2024-10-12 20:33:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:48,033 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3969 transitions. [2024-10-12 20:33:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.6) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 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-12 20:33:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3969 transitions. [2024-10-12 20:33:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:33:48,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:48,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 20:33:48,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 724063685, now seen corresponding path program 1 times [2024-10-12 20:33:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673686254] [2024-10-12 20:33:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:48,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:48,590 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-12 20:33:48,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:48,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673686254] [2024-10-12 20:33:48,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673686254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:48,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:48,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 20:33:48,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751393685] [2024-10-12 20:33:48,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:48,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 20:33:48,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:48,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 20:33:48,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-12 20:33:48,592 INFO L87 Difference]: Start difference. First operand 2761 states and 3969 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:51,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:51,185 INFO L93 Difference]: Finished difference Result 4697 states and 6730 transitions. [2024-10-12 20:33:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:33:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:33:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:51,195 INFO L225 Difference]: With dead ends: 4697 [2024-10-12 20:33:51,196 INFO L226 Difference]: Without dead ends: 4253 [2024-10-12 20:33:51,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-10-12 20:33:51,197 INFO L432 NwaCegarLoop]: 1448 mSDtfsCounter, 11064 mSDsluCounter, 6369 mSDsCounter, 0 mSdLazyCounter, 6498 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11064 SdHoareTripleChecker+Valid, 7817 SdHoareTripleChecker+Invalid, 6504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:51,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11064 Valid, 7817 Invalid, 6504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6498 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:33:51,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4253 states. [2024-10-12 20:33:51,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4253 to 2761. [2024-10-12 20:33:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4563142437591776) internal successors, (3967), 2760 states have internal predecessors, (3967), 0 states have call successors, (0), 0 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-12 20:33:51,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3967 transitions. [2024-10-12 20:33:51,237 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3967 transitions. Word has length 124 [2024-10-12 20:33:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:51,237 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3967 transitions. [2024-10-12 20:33:51,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 9 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3967 transitions. [2024-10-12 20:33:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:33:51,240 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:51,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 20:33:51,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 20:33:51,241 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:51,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1472003928, now seen corresponding path program 1 times [2024-10-12 20:33:51,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:51,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519467217] [2024-10-12 20:33:51,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:51,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:51,656 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-12 20:33:51,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:51,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519467217] [2024-10-12 20:33:51,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519467217] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:51,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:51,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 20:33:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632185101] [2024-10-12 20:33:51,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:51,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 20:33:51,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:51,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 20:33:51,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 20:33:51,659 INFO L87 Difference]: Start difference. First operand 2761 states and 3967 transitions. Second operand has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:53,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:53,961 INFO L93 Difference]: Finished difference Result 4586 states and 6337 transitions. [2024-10-12 20:33:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 20:33:53,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:33:53,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:53,969 INFO L225 Difference]: With dead ends: 4586 [2024-10-12 20:33:53,969 INFO L226 Difference]: Without dead ends: 3479 [2024-10-12 20:33:53,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 20:33:53,971 INFO L432 NwaCegarLoop]: 1132 mSDtfsCounter, 7480 mSDsluCounter, 3432 mSDsCounter, 0 mSdLazyCounter, 5592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7480 SdHoareTripleChecker+Valid, 4564 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:53,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7480 Valid, 4564 Invalid, 5593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5592 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 20:33:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2024-10-12 20:33:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 2761. [2024-10-12 20:33:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4559471365638768) internal successors, (3966), 2760 states have internal predecessors, (3966), 0 states have call successors, (0), 0 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-12 20:33:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3966 transitions. [2024-10-12 20:33:54,012 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3966 transitions. Word has length 124 [2024-10-12 20:33:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:54,013 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3966 transitions. [2024-10-12 20:33:54,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.714285714285715) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3966 transitions. [2024-10-12 20:33:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:33:54,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:54,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:54,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 20:33:54,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:54,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:54,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2082888358, now seen corresponding path program 1 times [2024-10-12 20:33:54,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:54,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895767779] [2024-10-12 20:33:54,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:54,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:54,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:54,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895767779] [2024-10-12 20:33:54,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895767779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:54,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:54,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:54,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398675451] [2024-10-12 20:33:54,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:54,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:33:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:33:54,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:33:54,645 INFO L87 Difference]: Start difference. First operand 2761 states and 3966 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:33:57,966 INFO L93 Difference]: Finished difference Result 4374 states and 6139 transitions. [2024-10-12 20:33:57,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:33:57,967 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:33:57,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:33:57,974 INFO L225 Difference]: With dead ends: 4374 [2024-10-12 20:33:57,974 INFO L226 Difference]: Without dead ends: 4179 [2024-10-12 20:33:57,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:33:57,976 INFO L432 NwaCegarLoop]: 1319 mSDtfsCounter, 13816 mSDsluCounter, 7011 mSDsCounter, 0 mSdLazyCounter, 8759 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13816 SdHoareTripleChecker+Valid, 8330 SdHoareTripleChecker+Invalid, 8769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 8759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:33:57,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13816 Valid, 8330 Invalid, 8769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 8759 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 20:33:57,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2024-10-12 20:33:58,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 2792. [2024-10-12 20:33:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2755 states have (on average 1.4562613430127043) internal successors, (4012), 2791 states have internal predecessors, (4012), 0 states have call successors, (0), 0 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-12 20:33:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4012 transitions. [2024-10-12 20:33:58,007 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4012 transitions. Word has length 124 [2024-10-12 20:33:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:33:58,008 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4012 transitions. [2024-10-12 20:33:58,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:33:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4012 transitions. [2024-10-12 20:33:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:33:58,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:33:58,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:33:58,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 20:33:58,011 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:33:58,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:33:58,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1960065936, now seen corresponding path program 1 times [2024-10-12 20:33:58,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:33:58,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881451532] [2024-10-12 20:33:58,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:33:58,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:33:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:33:58,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 20:33:58,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:33:58,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881451532] [2024-10-12 20:33:58,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881451532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:33:58,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:33:58,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:33:58,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990917148] [2024-10-12 20:33:58,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:33:58,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:33:58,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:33:58,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:33:58,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:33:58,415 INFO L87 Difference]: Start difference. First operand 2792 states and 4012 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:01,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:01,023 INFO L93 Difference]: Finished difference Result 4742 states and 6807 transitions. [2024-10-12 20:34:01,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 20:34:01,024 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:34:01,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:01,030 INFO L225 Difference]: With dead ends: 4742 [2024-10-12 20:34:01,030 INFO L226 Difference]: Without dead ends: 4330 [2024-10-12 20:34:01,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-12 20:34:01,032 INFO L432 NwaCegarLoop]: 1456 mSDtfsCounter, 6886 mSDsluCounter, 7253 mSDsCounter, 0 mSdLazyCounter, 7210 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6886 SdHoareTripleChecker+Valid, 8709 SdHoareTripleChecker+Invalid, 7219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:01,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6886 Valid, 8709 Invalid, 7219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 7210 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:34:01,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2024-10-12 20:34:01,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 2792. [2024-10-12 20:34:01,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2755 states have (on average 1.4558983666061707) internal successors, (4011), 2791 states have internal predecessors, (4011), 0 states have call successors, (0), 0 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-12 20:34:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4011 transitions. [2024-10-12 20:34:01,064 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4011 transitions. Word has length 124 [2024-10-12 20:34:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:01,064 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4011 transitions. [2024-10-12 20:34:01,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4011 transitions. [2024-10-12 20:34:01,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:34:01,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:01,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:01,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 20:34:01,068 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:01,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:01,069 INFO L85 PathProgramCache]: Analyzing trace with hash 284484050, now seen corresponding path program 1 times [2024-10-12 20:34:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:01,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120461859] [2024-10-12 20:34:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:01,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:01,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:01,491 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-12 20:34:01,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:01,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120461859] [2024-10-12 20:34:01,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120461859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:01,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:01,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 20:34:01,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32954557] [2024-10-12 20:34:01,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 20:34:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 20:34:01,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-12 20:34:01,493 INFO L87 Difference]: Start difference. First operand 2792 states and 4011 transitions. Second operand has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:04,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:04,226 INFO L93 Difference]: Finished difference Result 4376 states and 6140 transitions. [2024-10-12 20:34:04,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 20:34:04,227 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:34:04,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:04,233 INFO L225 Difference]: With dead ends: 4376 [2024-10-12 20:34:04,233 INFO L226 Difference]: Without dead ends: 4181 [2024-10-12 20:34:04,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2024-10-12 20:34:04,234 INFO L432 NwaCegarLoop]: 1319 mSDtfsCounter, 7472 mSDsluCounter, 6364 mSDsCounter, 0 mSdLazyCounter, 7840 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7472 SdHoareTripleChecker+Valid, 7683 SdHoareTripleChecker+Invalid, 7849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:04,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7472 Valid, 7683 Invalid, 7849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 7840 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 20:34:04,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2024-10-12 20:34:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 2818. [2024-10-12 20:34:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2781 states have (on average 1.4559510967277958) internal successors, (4049), 2817 states have internal predecessors, (4049), 0 states have call successors, (0), 0 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-12 20:34:04,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4049 transitions. [2024-10-12 20:34:04,269 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4049 transitions. Word has length 124 [2024-10-12 20:34:04,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:04,269 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4049 transitions. [2024-10-12 20:34:04,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.272727272727273) internal successors, (124), 10 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4049 transitions. [2024-10-12 20:34:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 20:34:04,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:04,273 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:04,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 20:34:04,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:04,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:04,274 INFO L85 PathProgramCache]: Analyzing trace with hash 722590670, now seen corresponding path program 1 times [2024-10-12 20:34:04,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:04,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261304156] [2024-10-12 20:34:04,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:04,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:04,649 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-12 20:34:04,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:04,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261304156] [2024-10-12 20:34:04,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261304156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:04,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:04,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:04,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764699267] [2024-10-12 20:34:04,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:04,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:04,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:04,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:04,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:04,651 INFO L87 Difference]: Start difference. First operand 2818 states and 4049 transitions. Second operand has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:06,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:06,571 INFO L93 Difference]: Finished difference Result 4368 states and 6214 transitions. [2024-10-12 20:34:06,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:06,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2024-10-12 20:34:06,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:06,577 INFO L225 Difference]: With dead ends: 4368 [2024-10-12 20:34:06,577 INFO L226 Difference]: Without dead ends: 4166 [2024-10-12 20:34:06,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:06,578 INFO L432 NwaCegarLoop]: 1392 mSDtfsCounter, 7025 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7025 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 5252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:06,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7025 Valid, 5998 Invalid, 5252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:34:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4166 states. [2024-10-12 20:34:06,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4166 to 2818. [2024-10-12 20:34:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2781 states have (on average 1.455591513843941) internal successors, (4048), 2817 states have internal predecessors, (4048), 0 states have call successors, (0), 0 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-12 20:34:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 4048 transitions. [2024-10-12 20:34:06,609 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 4048 transitions. Word has length 124 [2024-10-12 20:34:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:06,609 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 4048 transitions. [2024-10-12 20:34:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.5) internal successors, (124), 7 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 20:34:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 4048 transitions. [2024-10-12 20:34:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:06,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:06,614 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:06,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 20:34:06,614 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:06,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -2131091061, now seen corresponding path program 1 times [2024-10-12 20:34:06,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:06,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614003804] [2024-10-12 20:34:06,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:06,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:06,900 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-12 20:34:06,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:06,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614003804] [2024-10-12 20:34:06,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614003804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:06,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:06,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:06,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085554869] [2024-10-12 20:34:06,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:06,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:06,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:06,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:06,901 INFO L87 Difference]: Start difference. First operand 2818 states and 4048 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:08,462 INFO L93 Difference]: Finished difference Result 3464 states and 4987 transitions. [2024-10-12 20:34:08,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:34:08,462 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:08,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:08,467 INFO L225 Difference]: With dead ends: 3464 [2024-10-12 20:34:08,467 INFO L226 Difference]: Without dead ends: 2861 [2024-10-12 20:34:08,468 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-12 20:34:08,469 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 4056 mSDsluCounter, 5032 mSDsCounter, 0 mSdLazyCounter, 4775 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4056 SdHoareTripleChecker+Valid, 7062 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:08,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4056 Valid, 7062 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4775 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 20:34:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2024-10-12 20:34:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2761. [2024-10-12 20:34:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4552129221732746) internal successors, (3964), 2760 states have internal predecessors, (3964), 0 states have call successors, (0), 0 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-12 20:34:08,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3964 transitions. [2024-10-12 20:34:08,497 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3964 transitions. Word has length 126 [2024-10-12 20:34:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3964 transitions. [2024-10-12 20:34:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:08,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3964 transitions. [2024-10-12 20:34:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:08,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:08,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:08,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 20:34:08,501 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:08,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:08,501 INFO L85 PathProgramCache]: Analyzing trace with hash 46269361, now seen corresponding path program 1 times [2024-10-12 20:34:08,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:08,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102156810] [2024-10-12 20:34:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:08,780 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-12 20:34:08,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:08,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102156810] [2024-10-12 20:34:08,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102156810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:08,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:08,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:08,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824398589] [2024-10-12 20:34:08,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:08,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:08,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:08,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:08,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:08,781 INFO L87 Difference]: Start difference. First operand 2761 states and 3964 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:10,783 INFO L93 Difference]: Finished difference Result 4291 states and 6103 transitions. [2024-10-12 20:34:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:10,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:10,789 INFO L225 Difference]: With dead ends: 4291 [2024-10-12 20:34:10,789 INFO L226 Difference]: Without dead ends: 4089 [2024-10-12 20:34:10,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:10,791 INFO L432 NwaCegarLoop]: 1392 mSDtfsCounter, 7017 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 5240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7017 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 5244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:10,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7017 Valid, 5998 Invalid, 5244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5240 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:34:10,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2024-10-12 20:34:10,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2761. [2024-10-12 20:34:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4548458149779735) internal successors, (3963), 2760 states have internal predecessors, (3963), 0 states have call successors, (0), 0 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-12 20:34:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3963 transitions. [2024-10-12 20:34:10,821 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3963 transitions. Word has length 126 [2024-10-12 20:34:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:10,821 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3963 transitions. [2024-10-12 20:34:10,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3963 transitions. [2024-10-12 20:34:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:10,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:10,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:10,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 20:34:10,826 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:10,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:10,826 INFO L85 PathProgramCache]: Analyzing trace with hash -76553061, now seen corresponding path program 1 times [2024-10-12 20:34:10,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330905904] [2024-10-12 20:34:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:11,103 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-12 20:34:11,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:11,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330905904] [2024-10-12 20:34:11,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330905904] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:11,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:11,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:11,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111715284] [2024-10-12 20:34:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:11,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:11,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:11,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:11,105 INFO L87 Difference]: Start difference. First operand 2761 states and 3963 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:12,977 INFO L93 Difference]: Finished difference Result 4116 states and 5787 transitions. [2024-10-12 20:34:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:12,977 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:12,982 INFO L225 Difference]: With dead ends: 4116 [2024-10-12 20:34:12,982 INFO L226 Difference]: Without dead ends: 3921 [2024-10-12 20:34:12,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:12,984 INFO L432 NwaCegarLoop]: 1339 mSDtfsCounter, 7333 mSDsluCounter, 4167 mSDsCounter, 0 mSdLazyCounter, 5193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7333 SdHoareTripleChecker+Valid, 5506 SdHoareTripleChecker+Invalid, 5197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:12,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7333 Valid, 5506 Invalid, 5197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5193 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:34:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3921 states. [2024-10-12 20:34:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3921 to 2761. [2024-10-12 20:34:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4544787077826726) internal successors, (3962), 2760 states have internal predecessors, (3962), 0 states have call successors, (0), 0 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-12 20:34:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3962 transitions. [2024-10-12 20:34:13,010 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3962 transitions. Word has length 126 [2024-10-12 20:34:13,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:13,010 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3962 transitions. [2024-10-12 20:34:13,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3962 transitions. [2024-10-12 20:34:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:13,013 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:13,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 20:34:13,013 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:13,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1930060069, now seen corresponding path program 1 times [2024-10-12 20:34:13,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:13,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206474665] [2024-10-12 20:34:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:13,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:13,282 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-12 20:34:13,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206474665] [2024-10-12 20:34:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206474665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306505090] [2024-10-12 20:34:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:13,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:13,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:13,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:13,283 INFO L87 Difference]: Start difference. First operand 2761 states and 3962 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:15,329 INFO L93 Difference]: Finished difference Result 4487 states and 6421 transitions. [2024-10-12 20:34:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:15,333 INFO L225 Difference]: With dead ends: 4487 [2024-10-12 20:34:15,333 INFO L226 Difference]: Without dead ends: 4233 [2024-10-12 20:34:15,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:15,334 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 10401 mSDsluCounter, 5290 mSDsCounter, 0 mSdLazyCounter, 5622 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10401 SdHoareTripleChecker+Valid, 6844 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:15,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10401 Valid, 6844 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5622 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-12 20:34:15,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2024-10-12 20:34:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2761. [2024-10-12 20:34:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4541116005873715) internal successors, (3961), 2760 states have internal predecessors, (3961), 0 states have call successors, (0), 0 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-12 20:34:15,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3961 transitions. [2024-10-12 20:34:15,360 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3961 transitions. Word has length 126 [2024-10-12 20:34:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:15,360 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3961 transitions. [2024-10-12 20:34:15,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:15,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3961 transitions. [2024-10-12 20:34:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:15,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:15,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:15,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 20:34:15,363 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:15,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1752134947, now seen corresponding path program 1 times [2024-10-12 20:34:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:15,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363516724] [2024-10-12 20:34:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:15,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:15,641 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-12 20:34:15,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:15,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363516724] [2024-10-12 20:34:15,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363516724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:15,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:15,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306900243] [2024-10-12 20:34:15,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:15,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:15,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:15,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:15,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:15,643 INFO L87 Difference]: Start difference. First operand 2761 states and 3961 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:17,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:17,616 INFO L93 Difference]: Finished difference Result 4473 states and 6406 transitions. [2024-10-12 20:34:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:17,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:17,620 INFO L225 Difference]: With dead ends: 4473 [2024-10-12 20:34:17,620 INFO L226 Difference]: Without dead ends: 4233 [2024-10-12 20:34:17,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:17,621 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 10395 mSDsluCounter, 5290 mSDsCounter, 0 mSdLazyCounter, 5617 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10395 SdHoareTripleChecker+Valid, 6844 SdHoareTripleChecker+Invalid, 5621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:17,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10395 Valid, 6844 Invalid, 5621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5617 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:34:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2024-10-12 20:34:17,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2761. [2024-10-12 20:34:17,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4537444933920705) internal successors, (3960), 2760 states have internal predecessors, (3960), 0 states have call successors, (0), 0 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-12 20:34:17,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3960 transitions. [2024-10-12 20:34:17,648 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3960 transitions. Word has length 126 [2024-10-12 20:34:17,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:17,648 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3960 transitions. [2024-10-12 20:34:17,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:17,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3960 transitions. [2024-10-12 20:34:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:17,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:17,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 20:34:17,652 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:17,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1897230653, now seen corresponding path program 1 times [2024-10-12 20:34:17,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:17,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138747814] [2024-10-12 20:34:17,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:17,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:17,913 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-12 20:34:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138747814] [2024-10-12 20:34:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138747814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826904586] [2024-10-12 20:34:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:17,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:17,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:17,915 INFO L87 Difference]: Start difference. First operand 2761 states and 3960 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:20,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:20,036 INFO L93 Difference]: Finished difference Result 4473 states and 6402 transitions. [2024-10-12 20:34:20,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:20,037 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:20,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:20,040 INFO L225 Difference]: With dead ends: 4473 [2024-10-12 20:34:20,040 INFO L226 Difference]: Without dead ends: 4233 [2024-10-12 20:34:20,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:20,041 INFO L432 NwaCegarLoop]: 1554 mSDtfsCounter, 10392 mSDsluCounter, 5290 mSDsCounter, 0 mSdLazyCounter, 5612 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10392 SdHoareTripleChecker+Valid, 6844 SdHoareTripleChecker+Invalid, 5616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:20,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10392 Valid, 6844 Invalid, 5616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5612 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:34:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2024-10-12 20:34:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 2761. [2024-10-12 20:34:20,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4533773861967694) internal successors, (3959), 2760 states have internal predecessors, (3959), 0 states have call successors, (0), 0 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-12 20:34:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3959 transitions. [2024-10-12 20:34:20,067 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3959 transitions. Word has length 126 [2024-10-12 20:34:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:20,067 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3959 transitions. [2024-10-12 20:34:20,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3959 transitions. [2024-10-12 20:34:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:20,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:20,070 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 20:34:20,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:20,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:20,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1717228574, now seen corresponding path program 1 times [2024-10-12 20:34:20,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:20,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817144999] [2024-10-12 20:34:20,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:20,355 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-12 20:34:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:20,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817144999] [2024-10-12 20:34:20,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817144999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:20,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:20,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:20,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693972167] [2024-10-12 20:34:20,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:20,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:20,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:20,358 INFO L87 Difference]: Start difference. First operand 2761 states and 3959 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:22,572 INFO L93 Difference]: Finished difference Result 4669 states and 6704 transitions. [2024-10-12 20:34:22,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:34:22,572 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:22,576 INFO L225 Difference]: With dead ends: 4669 [2024-10-12 20:34:22,576 INFO L226 Difference]: Without dead ends: 4293 [2024-10-12 20:34:22,577 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-12 20:34:22,577 INFO L432 NwaCegarLoop]: 1780 mSDtfsCounter, 9609 mSDsluCounter, 6023 mSDsCounter, 0 mSdLazyCounter, 6378 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9609 SdHoareTripleChecker+Valid, 7803 SdHoareTripleChecker+Invalid, 6382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:22,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9609 Valid, 7803 Invalid, 6382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6378 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 20:34:22,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-10-12 20:34:22,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 2761. [2024-10-12 20:34:22,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4530102790014685) internal successors, (3958), 2760 states have internal predecessors, (3958), 0 states have call successors, (0), 0 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-12 20:34:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3958 transitions. [2024-10-12 20:34:22,610 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3958 transitions. Word has length 126 [2024-10-12 20:34:22,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:22,610 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3958 transitions. [2024-10-12 20:34:22,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3958 transitions. [2024-10-12 20:34:22,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:22,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:22,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:22,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 20:34:22,614 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:22,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:22,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1245745143, now seen corresponding path program 1 times [2024-10-12 20:34:22,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:22,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933211971] [2024-10-12 20:34:22,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:22,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:22,930 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-12 20:34:22,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933211971] [2024-10-12 20:34:22,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933211971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:22,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:22,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731069999] [2024-10-12 20:34:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:22,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:22,932 INFO L87 Difference]: Start difference. First operand 2761 states and 3958 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:25,445 INFO L93 Difference]: Finished difference Result 4530 states and 6495 transitions. [2024-10-12 20:34:25,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 20:34:25,446 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:25,450 INFO L225 Difference]: With dead ends: 4530 [2024-10-12 20:34:25,450 INFO L226 Difference]: Without dead ends: 4257 [2024-10-12 20:34:25,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-10-12 20:34:25,451 INFO L432 NwaCegarLoop]: 1719 mSDtfsCounter, 7970 mSDsluCounter, 6992 mSDsCounter, 0 mSdLazyCounter, 6951 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7970 SdHoareTripleChecker+Valid, 8711 SdHoareTripleChecker+Invalid, 6955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 6951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:25,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7970 Valid, 8711 Invalid, 6955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 6951 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:34:25,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2024-10-12 20:34:25,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 2761. [2024-10-12 20:34:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4526431718061674) internal successors, (3957), 2760 states have internal predecessors, (3957), 0 states have call successors, (0), 0 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-12 20:34:25,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3957 transitions. [2024-10-12 20:34:25,484 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3957 transitions. Word has length 126 [2024-10-12 20:34:25,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:25,485 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3957 transitions. [2024-10-12 20:34:25,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:25,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3957 transitions. [2024-10-12 20:34:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:25,488 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:25,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:25,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 20:34:25,488 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:25,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:25,488 INFO L85 PathProgramCache]: Analyzing trace with hash 794912785, now seen corresponding path program 1 times [2024-10-12 20:34:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:25,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70828457] [2024-10-12 20:34:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:25,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:25,728 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-12 20:34:25,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:25,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70828457] [2024-10-12 20:34:25,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70828457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:25,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:25,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:25,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202186442] [2024-10-12 20:34:25,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:25,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:25,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:25,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:25,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:25,729 INFO L87 Difference]: Start difference. First operand 2761 states and 3957 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:27,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:27,468 INFO L93 Difference]: Finished difference Result 3973 states and 5691 transitions. [2024-10-12 20:34:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:34:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:27,472 INFO L225 Difference]: With dead ends: 3973 [2024-10-12 20:34:27,472 INFO L226 Difference]: Without dead ends: 2861 [2024-10-12 20:34:27,473 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-12 20:34:27,474 INFO L432 NwaCegarLoop]: 1453 mSDtfsCounter, 6950 mSDsluCounter, 5025 mSDsCounter, 0 mSdLazyCounter, 5326 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6950 SdHoareTripleChecker+Valid, 6478 SdHoareTripleChecker+Invalid, 5330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:27,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6950 Valid, 6478 Invalid, 5330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5326 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 20:34:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2024-10-12 20:34:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2761. [2024-10-12 20:34:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4519089574155652) internal successors, (3955), 2760 states have internal predecessors, (3955), 0 states have call successors, (0), 0 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-12 20:34:27,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3955 transitions. [2024-10-12 20:34:27,499 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3955 transitions. Word has length 126 [2024-10-12 20:34:27,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:27,499 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3955 transitions. [2024-10-12 20:34:27,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:27,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3955 transitions. [2024-10-12 20:34:27,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:27,502 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:27,502 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 20:34:27,503 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:27,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 566046673, now seen corresponding path program 1 times [2024-10-12 20:34:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982357403] [2024-10-12 20:34:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:27,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:27,778 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-12 20:34:27,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982357403] [2024-10-12 20:34:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982357403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:27,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679950317] [2024-10-12 20:34:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:27,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:27,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:27,781 INFO L87 Difference]: Start difference. First operand 2761 states and 3955 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:29,640 INFO L93 Difference]: Finished difference Result 4297 states and 6100 transitions. [2024-10-12 20:34:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 20:34:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:29,645 INFO L225 Difference]: With dead ends: 4297 [2024-10-12 20:34:29,645 INFO L226 Difference]: Without dead ends: 4089 [2024-10-12 20:34:29,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:29,646 INFO L432 NwaCegarLoop]: 1392 mSDtfsCounter, 6993 mSDsluCounter, 4606 mSDsCounter, 0 mSdLazyCounter, 5212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6993 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 5216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:29,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6993 Valid, 5998 Invalid, 5216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5212 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 20:34:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2024-10-12 20:34:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2761. [2024-10-12 20:34:29,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4511747430249633) internal successors, (3953), 2760 states have internal predecessors, (3953), 0 states have call successors, (0), 0 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-12 20:34:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3953 transitions. [2024-10-12 20:34:29,669 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3953 transitions. Word has length 126 [2024-10-12 20:34:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:29,670 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3953 transitions. [2024-10-12 20:34:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3953 transitions. [2024-10-12 20:34:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 20:34:29,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:29,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:29,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 20:34:29,673 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1930516315, now seen corresponding path program 1 times [2024-10-12 20:34:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036160331] [2024-10-12 20:34:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:29,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:30,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-12 20:34:30,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:30,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036160331] [2024-10-12 20:34:30,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036160331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:30,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:30,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:30,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573056526] [2024-10-12 20:34:30,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:30,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:30,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:30,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:30,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:30,016 INFO L87 Difference]: Start difference. First operand 2761 states and 3953 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:32,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:32,566 INFO L93 Difference]: Finished difference Result 4885 states and 7004 transitions. [2024-10-12 20:34:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:34:32,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 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 126 [2024-10-12 20:34:32,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:32,570 INFO L225 Difference]: With dead ends: 4885 [2024-10-12 20:34:32,570 INFO L226 Difference]: Without dead ends: 4293 [2024-10-12 20:34:32,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-12 20:34:32,572 INFO L432 NwaCegarLoop]: 2227 mSDtfsCounter, 8005 mSDsluCounter, 7362 mSDsCounter, 0 mSdLazyCounter, 7755 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8005 SdHoareTripleChecker+Valid, 9589 SdHoareTripleChecker+Invalid, 7758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:32,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8005 Valid, 9589 Invalid, 7758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7755 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 20:34:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-10-12 20:34:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 2761. [2024-10-12 20:34:32,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4504405286343611) internal successors, (3951), 2760 states have internal predecessors, (3951), 0 states have call successors, (0), 0 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-12 20:34:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3951 transitions. [2024-10-12 20:34:32,594 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3951 transitions. Word has length 126 [2024-10-12 20:34:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:32,594 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3951 transitions. [2024-10-12 20:34:32,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 7 states have internal predecessors, (126), 0 states have call successors, (0), 0 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-12 20:34:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3951 transitions. [2024-10-12 20:34:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 20:34:32,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:32,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:32,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 20:34:32,597 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:32,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:32,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1642713865, now seen corresponding path program 1 times [2024-10-12 20:34:32,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:32,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091388614] [2024-10-12 20:34:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:32,835 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-12 20:34:32,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:32,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091388614] [2024-10-12 20:34:32,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091388614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:32,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:32,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118946477] [2024-10-12 20:34:32,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:32,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:32,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:32,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:32,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:32,838 INFO L87 Difference]: Start difference. First operand 2761 states and 3951 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-12 20:34:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:34,848 INFO L93 Difference]: Finished difference Result 4287 states and 6082 transitions. [2024-10-12 20:34:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:34:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-12 20:34:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:34,852 INFO L225 Difference]: With dead ends: 4287 [2024-10-12 20:34:34,852 INFO L226 Difference]: Without dead ends: 4089 [2024-10-12 20:34:34,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-10-12 20:34:34,854 INFO L432 NwaCegarLoop]: 1392 mSDtfsCounter, 10764 mSDsluCounter, 4609 mSDsCounter, 0 mSdLazyCounter, 5202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10764 SdHoareTripleChecker+Valid, 6001 SdHoareTripleChecker+Invalid, 5206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:34,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10764 Valid, 6001 Invalid, 5206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5202 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 20:34:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4089 states. [2024-10-12 20:34:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4089 to 2761. [2024-10-12 20:34:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4500734214390603) internal successors, (3950), 2760 states have internal predecessors, (3950), 0 states have call successors, (0), 0 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-12 20:34:34,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3950 transitions. [2024-10-12 20:34:34,881 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3950 transitions. Word has length 128 [2024-10-12 20:34:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:34,882 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3950 transitions. [2024-10-12 20:34:34,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-12 20:34:34,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3950 transitions. [2024-10-12 20:34:34,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 20:34:34,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:34,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:34,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 20:34:34,886 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:34,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 493655107, now seen corresponding path program 1 times [2024-10-12 20:34:34,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:34,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667015992] [2024-10-12 20:34:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:34,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:35,191 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-12 20:34:35,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:35,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667015992] [2024-10-12 20:34:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667015992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:35,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:35,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842294781] [2024-10-12 20:34:35,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:35,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:35,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:35,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:35,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:35,193 INFO L87 Difference]: Start difference. First operand 2761 states and 3950 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-12 20:34:37,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 20:34:37,650 INFO L93 Difference]: Finished difference Result 4705 states and 6731 transitions. [2024-10-12 20:34:37,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 20:34:37,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-10-12 20:34:37,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 20:34:37,655 INFO L225 Difference]: With dead ends: 4705 [2024-10-12 20:34:37,655 INFO L226 Difference]: Without dead ends: 4293 [2024-10-12 20:34:37,656 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-12 20:34:37,656 INFO L432 NwaCegarLoop]: 2830 mSDtfsCounter, 5315 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 7749 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5315 SdHoareTripleChecker+Valid, 10995 SdHoareTripleChecker+Invalid, 7752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 20:34:37,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5315 Valid, 10995 Invalid, 7752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7749 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 20:34:37,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4293 states. [2024-10-12 20:34:37,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4293 to 2761. [2024-10-12 20:34:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2724 states have (on average 1.4497063142437592) internal successors, (3949), 2760 states have internal predecessors, (3949), 0 states have call successors, (0), 0 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-12 20:34:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3949 transitions. [2024-10-12 20:34:37,680 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3949 transitions. Word has length 128 [2024-10-12 20:34:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 20:34:37,680 INFO L471 AbstractCegarLoop]: Abstraction has 2761 states and 3949 transitions. [2024-10-12 20:34:37,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 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-12 20:34:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3949 transitions. [2024-10-12 20:34:37,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 20:34:37,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 20:34:37,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 20:34:37,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 20:34:37,683 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 34 more)] === [2024-10-12 20:34:37,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 20:34:37,684 INFO L85 PathProgramCache]: Analyzing trace with hash 401924492, now seen corresponding path program 1 times [2024-10-12 20:34:37,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 20:34:37,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669095779] [2024-10-12 20:34:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 20:34:37,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 20:34:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 20:34:37,958 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-12 20:34:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 20:34:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669095779] [2024-10-12 20:34:37,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669095779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 20:34:37,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 20:34:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 20:34:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607844254] [2024-10-12 20:34:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 20:34:37,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 20:34:37,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 20:34:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 20:34:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 20:34:37,959 INFO L87 Difference]: Start difference. First operand 2761 states and 3949 transitions. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 7 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)