./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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:57:25,159 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:57:25,208 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:57:25,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:57:25,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:57:25,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:57:25,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:57:25,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:57:25,236 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:57:25,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:57:25,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:57:25,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:57:25,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:57:25,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:57:25,242 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:57:25,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:57:25,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:57:25,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:57:25,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:57:25,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:57:25,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:57:25,243 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:57:25,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:57:25,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:57:25,244 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:57:25,244 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:57:25,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:57:25,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:57:25,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:57:25,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:57:25,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:57:25,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:57:25,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:57:25,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:57:25,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:57:25,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:57:25,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:57:25,247 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:57:25,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:57:25,247 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:57:25,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:57:25,248 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:57:25,248 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 -> dbfd30746a885b9515f914ecf1282b7cce3374e505c2f59173500b59d4c3c5b9 [2024-10-14 03:57:25,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:57:25,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:57:25,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:57:25,448 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:57:25,448 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:57:25,449 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:57:26,631 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:57:26,881 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:57:26,881 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:57:26,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990c24de7/b6b21918040b43a0bf9c147c32c6a95c/FLAGed7dc9091 [2024-10-14 03:57:26,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/990c24de7/b6b21918040b43a0bf9c147c32c6a95c [2024-10-14 03:57:26,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:57:26,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:57:26,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:57:26,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:57:26,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:57:26,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:57:26" (1/1) ... [2024-10-14 03:57:26,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9755f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:26, skipping insertion in model container [2024-10-14 03:57:26,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:57:26" (1/1) ... [2024-10-14 03:57:26,976 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:57:27,248 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-10-14 03:57:27,279 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-10-14 03:57:27,285 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-10-14 03:57:27,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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-10-14 03:57:27,299 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-10-14 03:57:27,303 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-10-14 03:57:27,306 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-10-14 03:57:27,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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-10-14 03:57:27,321 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-10-14 03:57:27,329 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-10-14 03:57:27,342 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-10-14 03:57:27,355 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-10-14 03:57:27,359 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-10-14 03:57:27,367 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-10-14 03:57:27,379 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-10-14 03:57:27,389 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-10-14 03:57:27,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:57:27,537 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:57:27,577 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[10929,10942] [2024-10-14 03:57:27,583 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[14786,14799] [2024-10-14 03:57:27,586 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16007,16020] [2024-10-14 03:57:27,589 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[16713,16726] [2024-10-14 03:57:27,592 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18257,18270] [2024-10-14 03:57:27,598 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18963,18976] [2024-10-14 03:57:27,605 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19992,20005] [2024-10-14 03:57:27,615 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22398,22411] [2024-10-14 03:57:27,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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23107,23120] [2024-10-14 03:57:27,624 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[24144,24157] [2024-10-14 03:57:27,628 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26040,26053] [2024-10-14 03:57:27,637 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29948,29961] [2024-10-14 03:57:27,639 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[30657,30670] [2024-10-14 03:57:27,642 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[31689,31702] [2024-10-14 03:57:27,646 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33580,33593] [2024-10-14 03:57:27,655 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.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[36793,36806] [2024-10-14 03:57:27,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:57:27,735 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:57:27,736 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27 WrapperNode [2024-10-14 03:57:27,737 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:57:27,737 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:57:27,738 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:57:27,738 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:57:27,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,846 INFO L138 Inliner]: procedures = 25, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3579 [2024-10-14 03:57:27,847 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:57:27,847 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:57:27,847 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:57:27,847 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:57:27,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,864 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,907 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 03:57:27,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,983 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:27,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:28,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:57:28,007 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:57:28,007 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:57:28,007 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:57:28,008 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (1/1) ... [2024-10-14 03:57:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:57:28,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:57:28,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 03:57:28,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 03:57:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:57:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:57:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:57:28,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:57:28,215 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:57:28,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:57:29,597 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-10-14 03:57:29,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:57:29,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:57:29,653 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 03:57:29,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:57:29 BoogieIcfgContainer [2024-10-14 03:57:29,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:57:29,655 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:57:29,655 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:57:29,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:57:29,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:57:26" (1/3) ... [2024-10-14 03:57:29,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30d107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:57:29, skipping insertion in model container [2024-10-14 03:57:29,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:57:27" (2/3) ... [2024-10-14 03:57:29,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e30d107 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:57:29, skipping insertion in model container [2024-10-14 03:57:29,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:57:29" (3/3) ... [2024-10-14 03:57:29,659 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-14 03:57:29,670 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:57:29,671 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-10-14 03:57:29,733 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:57:29,738 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;@2ee390a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:57:29,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-14 03:57:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:29,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 03:57:29,764 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:29,764 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] [2024-10-14 03:57:29,764 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1484817577, now seen corresponding path program 1 times [2024-10-14 03:57:29,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:29,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546010449] [2024-10-14 03:57:29,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:30,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:30,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546010449] [2024-10-14 03:57:30,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546010449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:30,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:30,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:57:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530694021] [2024-10-14 03:57:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:30,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:57:30,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:30,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:57:30,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:57:30,230 INFO L87 Difference]: Start difference. First operand has 624 states, 607 states have (on average 1.8533772652388798) internal successors, (1125), 623 states have internal predecessors, (1125), 0 states have call successors, (0), 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 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:30,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:30,674 INFO L93 Difference]: Finished difference Result 966 states and 1681 transitions. [2024-10-14 03:57:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:57:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-10-14 03:57:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:30,689 INFO L225 Difference]: With dead ends: 966 [2024-10-14 03:57:30,689 INFO L226 Difference]: Without dead ends: 506 [2024-10-14 03:57:30,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:30,698 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 2529 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2529 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:30,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2529 Valid, 618 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-10-14 03:57:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 506. [2024-10-14 03:57:30,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 490 states have (on average 1.3061224489795917) internal successors, (640), 505 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 640 transitions. [2024-10-14 03:57:30,745 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 640 transitions. Word has length 70 [2024-10-14 03:57:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:30,745 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 640 transitions. [2024-10-14 03:57:30,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:30,746 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 640 transitions. [2024-10-14 03:57:30,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 03:57:30,748 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:30,748 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] [2024-10-14 03:57:30,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:57:30,751 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1062417945, now seen corresponding path program 1 times [2024-10-14 03:57:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131455308] [2024-10-14 03:57:30,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:30,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:30,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:30,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:30,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131455308] [2024-10-14 03:57:30,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131455308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:30,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:30,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:57:30,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844639943] [2024-10-14 03:57:30,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:30,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:57:30,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:30,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:57:30,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:57:30,922 INFO L87 Difference]: Start difference. First operand 506 states and 640 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:31,188 INFO L93 Difference]: Finished difference Result 842 states and 1095 transitions. [2024-10-14 03:57:31,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:57:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2024-10-14 03:57:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:31,192 INFO L225 Difference]: With dead ends: 842 [2024-10-14 03:57:31,192 INFO L226 Difference]: Without dead ends: 454 [2024-10-14 03:57:31,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:31,194 INFO L432 NwaCegarLoop]: 315 mSDtfsCounter, 1657 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:31,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 343 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:31,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-10-14 03:57:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2024-10-14 03:57:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 438 states have (on average 1.321917808219178) internal successors, (579), 453 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 579 transitions. [2024-10-14 03:57:31,209 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 579 transitions. Word has length 71 [2024-10-14 03:57:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:31,209 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 579 transitions. [2024-10-14 03:57:31,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 579 transitions. [2024-10-14 03:57:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 03:57:31,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:31,211 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:31,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:57:31,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:31,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1527977194, now seen corresponding path program 1 times [2024-10-14 03:57:31,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446190355] [2024-10-14 03:57:31,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:31,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446190355] [2024-10-14 03:57:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446190355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:31,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:57:31,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890675027] [2024-10-14 03:57:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:31,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:57:31,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:57:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:57:31,318 INFO L87 Difference]: Start difference. First operand 454 states and 579 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:31,577 INFO L93 Difference]: Finished difference Result 790 states and 1033 transitions. [2024-10-14 03:57:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:57:31,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-14 03:57:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:31,579 INFO L225 Difference]: With dead ends: 790 [2024-10-14 03:57:31,579 INFO L226 Difference]: Without dead ends: 416 [2024-10-14 03:57:31,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:31,580 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1555 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:31,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 319 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-10-14 03:57:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-10-14 03:57:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 400 states have (on average 1.34) internal successors, (536), 415 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 536 transitions. [2024-10-14 03:57:31,589 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 536 transitions. Word has length 72 [2024-10-14 03:57:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:31,589 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 536 transitions. [2024-10-14 03:57:31,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:31,590 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 536 transitions. [2024-10-14 03:57:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-14 03:57:31,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:31,593 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] [2024-10-14 03:57:31,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:57:31,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1740804882, now seen corresponding path program 1 times [2024-10-14 03:57:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211073969] [2024-10-14 03:57:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:31,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:31,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:31,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:31,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211073969] [2024-10-14 03:57:31,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211073969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:31,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:31,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:57:31,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775788057] [2024-10-14 03:57:31,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:31,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:57:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:57:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:57:31,719 INFO L87 Difference]: Start difference. First operand 416 states and 536 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:32,014 INFO L93 Difference]: Finished difference Result 965 states and 1273 transitions. [2024-10-14 03:57:32,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:57:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2024-10-14 03:57:32,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:32,016 INFO L225 Difference]: With dead ends: 965 [2024-10-14 03:57:32,016 INFO L226 Difference]: Without dead ends: 607 [2024-10-14 03:57:32,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:32,018 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 2057 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2057 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:32,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2057 Valid, 466 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:57:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2024-10-14 03:57:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 547. [2024-10-14 03:57:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 531 states have (on average 1.39924670433145) internal successors, (743), 546 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 743 transitions. [2024-10-14 03:57:32,032 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 743 transitions. Word has length 73 [2024-10-14 03:57:32,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:32,032 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 743 transitions. [2024-10-14 03:57:32,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,033 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 743 transitions. [2024-10-14 03:57:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 03:57:32,033 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:32,034 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:32,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:57:32,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:32,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash -759675733, now seen corresponding path program 1 times [2024-10-14 03:57:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:32,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163298830] [2024-10-14 03:57:32,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:32,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:32,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:32,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:32,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163298830] [2024-10-14 03:57:32,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163298830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:32,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:32,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 03:57:32,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205190440] [2024-10-14 03:57:32,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:32,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:57:32,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:32,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:57:32,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:57:32,129 INFO L87 Difference]: Start difference. First operand 547 states and 743 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:32,385 INFO L93 Difference]: Finished difference Result 1036 states and 1427 transitions. [2024-10-14 03:57:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 03:57:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2024-10-14 03:57:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:32,387 INFO L225 Difference]: With dead ends: 1036 [2024-10-14 03:57:32,387 INFO L226 Difference]: Without dead ends: 542 [2024-10-14 03:57:32,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:32,389 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1414 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:32,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 280 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:32,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-10-14 03:57:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2024-10-14 03:57:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.397338403041825) internal successors, (735), 541 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 735 transitions. [2024-10-14 03:57:32,400 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 735 transitions. Word has length 74 [2024-10-14 03:57:32,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:32,400 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 735 transitions. [2024-10-14 03:57:32,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:32,401 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 735 transitions. [2024-10-14 03:57:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:57:32,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:32,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:32,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:57:32,404 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:32,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:32,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1130154961, now seen corresponding path program 1 times [2024-10-14 03:57:32,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:32,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16992998] [2024-10-14 03:57:32,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:32,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:32,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:32,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16992998] [2024-10-14 03:57:32,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16992998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:32,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:32,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:57:32,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013876880] [2024-10-14 03:57:32,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:32,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:57:32,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:32,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:57:32,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:57:32,699 INFO L87 Difference]: Start difference. First operand 542 states and 735 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:33,179 INFO L93 Difference]: Finished difference Result 1044 states and 1397 transitions. [2024-10-14 03:57:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 03:57:33,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:57:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:33,185 INFO L225 Difference]: With dead ends: 1044 [2024-10-14 03:57:33,185 INFO L226 Difference]: Without dead ends: 770 [2024-10-14 03:57:33,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:57:33,186 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 1763 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:33,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 893 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-10-14 03:57:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 542. [2024-10-14 03:57:33,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3954372623574145) internal successors, (734), 541 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 734 transitions. [2024-10-14 03:57:33,195 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 734 transitions. Word has length 75 [2024-10-14 03:57:33,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:33,195 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 734 transitions. [2024-10-14 03:57:33,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,196 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 734 transitions. [2024-10-14 03:57:33,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:57:33,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:33,197 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:33,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:57:33,198 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:33,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:33,198 INFO L85 PathProgramCache]: Analyzing trace with hash 496363608, now seen corresponding path program 1 times [2024-10-14 03:57:33,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:33,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111676818] [2024-10-14 03:57:33,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:33,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:33,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111676818] [2024-10-14 03:57:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111676818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:33,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:33,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:33,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286380503] [2024-10-14 03:57:33,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:33,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:33,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:33,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:33,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:33,463 INFO L87 Difference]: Start difference. First operand 542 states and 734 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:33,985 INFO L93 Difference]: Finished difference Result 800 states and 1107 transitions. [2024-10-14 03:57:33,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:33,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:57:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:33,987 INFO L225 Difference]: With dead ends: 800 [2024-10-14 03:57:33,987 INFO L226 Difference]: Without dead ends: 610 [2024-10-14 03:57:33,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:33,988 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1534 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:33,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 1258 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-10-14 03:57:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 542. [2024-10-14 03:57:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3935361216730038) internal successors, (733), 541 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 733 transitions. [2024-10-14 03:57:33,996 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 733 transitions. Word has length 75 [2024-10-14 03:57:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:33,997 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 733 transitions. [2024-10-14 03:57:33,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 733 transitions. [2024-10-14 03:57:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 03:57:34,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:34,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:34,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:57:34,002 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:34,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:34,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1385408418, now seen corresponding path program 1 times [2024-10-14 03:57:34,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:34,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790456098] [2024-10-14 03:57:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:34,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:34,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:34,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:34,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790456098] [2024-10-14 03:57:34,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790456098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:34,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:34,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:34,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211802315] [2024-10-14 03:57:34,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:34,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:34,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:34,218 INFO L87 Difference]: Start difference. First operand 542 states and 733 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:34,785 INFO L93 Difference]: Finished difference Result 1020 states and 1409 transitions. [2024-10-14 03:57:34,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:34,786 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-10-14 03:57:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:34,788 INFO L225 Difference]: With dead ends: 1020 [2024-10-14 03:57:34,788 INFO L226 Difference]: Without dead ends: 869 [2024-10-14 03:57:34,789 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-14 03:57:34,789 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 1764 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:34,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 1599 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-10-14 03:57:34,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 542. [2024-10-14 03:57:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.391634980988593) internal successors, (732), 541 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 732 transitions. [2024-10-14 03:57:34,798 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 732 transitions. Word has length 75 [2024-10-14 03:57:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:34,798 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 732 transitions. [2024-10-14 03:57:34,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:34,798 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 732 transitions. [2024-10-14 03:57:34,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:34,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:34,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:34,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:57:34,799 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:34,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:34,799 INFO L85 PathProgramCache]: Analyzing trace with hash -821108329, now seen corresponding path program 1 times [2024-10-14 03:57:34,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:34,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687536080] [2024-10-14 03:57:34,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:34,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:34,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:35,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:35,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:35,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687536080] [2024-10-14 03:57:35,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687536080] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:35,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:35,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:35,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997576735] [2024-10-14 03:57:35,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:35,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:35,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:35,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:35,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:35,021 INFO L87 Difference]: Start difference. First operand 542 states and 732 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:35,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:35,560 INFO L93 Difference]: Finished difference Result 1029 states and 1417 transitions. [2024-10-14 03:57:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:35,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:35,563 INFO L225 Difference]: With dead ends: 1029 [2024-10-14 03:57:35,563 INFO L226 Difference]: Without dead ends: 869 [2024-10-14 03:57:35,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:57:35,564 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1032 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:35,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1838 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-10-14 03:57:35,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 542. [2024-10-14 03:57:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3897338403041826) internal successors, (731), 541 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:35,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 731 transitions. [2024-10-14 03:57:35,573 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 731 transitions. Word has length 77 [2024-10-14 03:57:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:35,573 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 731 transitions. [2024-10-14 03:57:35,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 731 transitions. [2024-10-14 03:57:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:35,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:35,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:35,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:57:35,574 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:35,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1229953557, now seen corresponding path program 1 times [2024-10-14 03:57:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487230510] [2024-10-14 03:57:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:35,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:35,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:35,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487230510] [2024-10-14 03:57:35,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487230510] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:35,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:35,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:35,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54740928] [2024-10-14 03:57:35,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:35,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:35,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:35,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:35,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:35,799 INFO L87 Difference]: Start difference. First operand 542 states and 731 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:36,398 INFO L93 Difference]: Finished difference Result 983 states and 1348 transitions. [2024-10-14 03:57:36,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:36,398 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:36,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:36,400 INFO L225 Difference]: With dead ends: 983 [2024-10-14 03:57:36,401 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 03:57:36,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:36,401 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 1912 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1912 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:36,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1912 Valid, 1396 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 03:57:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 542. [2024-10-14 03:57:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3878326996197718) internal successors, (730), 541 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 730 transitions. [2024-10-14 03:57:36,410 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 730 transitions. Word has length 77 [2024-10-14 03:57:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:36,410 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 730 transitions. [2024-10-14 03:57:36,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 730 transitions. [2024-10-14 03:57:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:36,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:36,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:36,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:57:36,411 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:36,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:36,412 INFO L85 PathProgramCache]: Analyzing trace with hash -861851382, now seen corresponding path program 1 times [2024-10-14 03:57:36,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:36,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668506254] [2024-10-14 03:57:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:36,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:36,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668506254] [2024-10-14 03:57:36,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668506254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:36,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:36,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:57:36,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095127577] [2024-10-14 03:57:36,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:36,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:57:36,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:36,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:57:36,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:57:36,776 INFO L87 Difference]: Start difference. First operand 542 states and 730 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:37,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:37,699 INFO L93 Difference]: Finished difference Result 1383 states and 1938 transitions. [2024-10-14 03:57:37,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:57:37,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:37,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:37,703 INFO L225 Difference]: With dead ends: 1383 [2024-10-14 03:57:37,703 INFO L226 Difference]: Without dead ends: 1245 [2024-10-14 03:57:37,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:57:37,704 INFO L432 NwaCegarLoop]: 320 mSDtfsCounter, 4170 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1446 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4170 SdHoareTripleChecker+Valid, 1782 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:37,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4170 Valid, 1782 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1446 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:57:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-14 03:57:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 546. [2024-10-14 03:57:37,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3849056603773584) internal successors, (734), 545 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 734 transitions. [2024-10-14 03:57:37,713 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 734 transitions. Word has length 77 [2024-10-14 03:57:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 734 transitions. [2024-10-14 03:57:37,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 10 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 734 transitions. [2024-10-14 03:57:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:37,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:37,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:37,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:57:37,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:37,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:37,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1582421198, now seen corresponding path program 1 times [2024-10-14 03:57:37,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:37,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883092355] [2024-10-14 03:57:37,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:37,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:37,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:37,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:37,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883092355] [2024-10-14 03:57:37,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883092355] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:37,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763248325] [2024-10-14 03:57:37,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:37,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:37,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:37,890 INFO L87 Difference]: Start difference. First operand 546 states and 734 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:38,370 INFO L93 Difference]: Finished difference Result 979 states and 1342 transitions. [2024-10-14 03:57:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:38,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:38,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:38,374 INFO L225 Difference]: With dead ends: 979 [2024-10-14 03:57:38,375 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 03:57:38,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:38,375 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1938 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1938 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:38,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1938 Valid, 1364 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 03:57:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 546. [2024-10-14 03:57:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3830188679245283) internal successors, (733), 545 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 733 transitions. [2024-10-14 03:57:38,383 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 733 transitions. Word has length 77 [2024-10-14 03:57:38,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:38,383 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 733 transitions. [2024-10-14 03:57:38,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:38,383 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 733 transitions. [2024-10-14 03:57:38,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:38,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:38,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:38,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:57:38,384 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:38,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:38,385 INFO L85 PathProgramCache]: Analyzing trace with hash 981154930, now seen corresponding path program 1 times [2024-10-14 03:57:38,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:38,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661624353] [2024-10-14 03:57:38,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:38,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:38,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:38,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661624353] [2024-10-14 03:57:38,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661624353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:38,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:38,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811034336] [2024-10-14 03:57:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:38,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:38,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:38,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:38,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:38,577 INFO L87 Difference]: Start difference. First operand 546 states and 733 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:39,068 INFO L93 Difference]: Finished difference Result 870 states and 1194 transitions. [2024-10-14 03:57:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:39,068 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:39,070 INFO L225 Difference]: With dead ends: 870 [2024-10-14 03:57:39,070 INFO L226 Difference]: Without dead ends: 614 [2024-10-14 03:57:39,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:57:39,071 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1517 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:39,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 1255 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2024-10-14 03:57:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 546. [2024-10-14 03:57:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.379245283018868) internal successors, (731), 545 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 731 transitions. [2024-10-14 03:57:39,079 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 731 transitions. Word has length 77 [2024-10-14 03:57:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:39,079 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 731 transitions. [2024-10-14 03:57:39,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 731 transitions. [2024-10-14 03:57:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:39,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:39,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:39,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:57:39,081 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:39,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash -817405268, now seen corresponding path program 1 times [2024-10-14 03:57:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:39,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708665414] [2024-10-14 03:57:39,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:39,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708665414] [2024-10-14 03:57:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708665414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:39,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723725808] [2024-10-14 03:57:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:39,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:39,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:39,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:39,289 INFO L87 Difference]: Start difference. First operand 546 states and 731 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:39,810 INFO L93 Difference]: Finished difference Result 989 states and 1351 transitions. [2024-10-14 03:57:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:39,811 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:39,813 INFO L225 Difference]: With dead ends: 989 [2024-10-14 03:57:39,813 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 03:57:39,813 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-14 03:57:39,814 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1930 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1930 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:39,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1930 Valid, 1364 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 03:57:39,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 546. [2024-10-14 03:57:39,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3754716981132076) internal successors, (729), 545 states have internal predecessors, (729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 729 transitions. [2024-10-14 03:57:39,821 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 729 transitions. Word has length 77 [2024-10-14 03:57:39,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:39,821 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 729 transitions. [2024-10-14 03:57:39,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 729 transitions. [2024-10-14 03:57:39,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-14 03:57:39,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:39,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:57:39,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -408560040, now seen corresponding path program 1 times [2024-10-14 03:57:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983322861] [2024-10-14 03:57:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:39,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:39,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:39,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983322861] [2024-10-14 03:57:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983322861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:39,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354118566] [2024-10-14 03:57:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:39,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:39,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:39,975 INFO L87 Difference]: Start difference. First operand 546 states and 729 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:40,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:40,605 INFO L93 Difference]: Finished difference Result 1043 states and 1426 transitions. [2024-10-14 03:57:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:40,606 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2024-10-14 03:57:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:40,608 INFO L225 Difference]: With dead ends: 1043 [2024-10-14 03:57:40,608 INFO L226 Difference]: Without dead ends: 873 [2024-10-14 03:57:40,608 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-14 03:57:40,609 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1537 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:40,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1863 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2024-10-14 03:57:40,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 546. [2024-10-14 03:57:40,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3716981132075472) internal successors, (727), 545 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 727 transitions. [2024-10-14 03:57:40,618 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 727 transitions. Word has length 77 [2024-10-14 03:57:40,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:40,618 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 727 transitions. [2024-10-14 03:57:40,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 7 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:40,618 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 727 transitions. [2024-10-14 03:57:40,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-14 03:57:40,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:40,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 03:57:40,619 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:40,620 INFO L85 PathProgramCache]: Analyzing trace with hash -180251782, now seen corresponding path program 1 times [2024-10-14 03:57:40,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:40,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011773268] [2024-10-14 03:57:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:40,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-14 03:57:40,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:40,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011773268] [2024-10-14 03:57:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011773268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:40,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:40,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453778036] [2024-10-14 03:57:40,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:40,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:40,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:40,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:40,784 INFO L87 Difference]: Start difference. First operand 546 states and 727 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:41,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:41,286 INFO L93 Difference]: Finished difference Result 830 states and 1101 transitions. [2024-10-14 03:57:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2024-10-14 03:57:41,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:41,289 INFO L225 Difference]: With dead ends: 830 [2024-10-14 03:57:41,289 INFO L226 Difference]: Without dead ends: 825 [2024-10-14 03:57:41,289 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-14 03:57:41,289 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 1951 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1951 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:41,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1951 Valid, 1250 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-14 03:57:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-14 03:57:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.369811320754717) internal successors, (726), 545 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 726 transitions. [2024-10-14 03:57:41,295 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 726 transitions. Word has length 78 [2024-10-14 03:57:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:41,296 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 726 transitions. [2024-10-14 03:57:41,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 7 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 726 transitions. [2024-10-14 03:57:41,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:41,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:41,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:41,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 03:57:41,298 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:41,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:41,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1887565433, now seen corresponding path program 1 times [2024-10-14 03:57:41,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:41,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49983279] [2024-10-14 03:57:41,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:41,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:41,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:41,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49983279] [2024-10-14 03:57:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49983279] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:41,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:41,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:41,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089324412] [2024-10-14 03:57:41,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:41,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:41,538 INFO L87 Difference]: Start difference. First operand 546 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:42,085 INFO L93 Difference]: Finished difference Result 953 states and 1287 transitions. [2024-10-14 03:57:42,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:42,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:42,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:42,087 INFO L225 Difference]: With dead ends: 953 [2024-10-14 03:57:42,088 INFO L226 Difference]: Without dead ends: 825 [2024-10-14 03:57:42,088 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-14 03:57:42,088 INFO L432 NwaCegarLoop]: 384 mSDtfsCounter, 1560 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1755 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:42,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 1755 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-14 03:57:42,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-14 03:57:42,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3679245283018868) internal successors, (725), 545 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 725 transitions. [2024-10-14 03:57:42,095 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 725 transitions. Word has length 79 [2024-10-14 03:57:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:42,095 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 725 transitions. [2024-10-14 03:57:42,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 725 transitions. [2024-10-14 03:57:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:42,096 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:42,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:42,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 03:57:42,097 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:42,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1141656959, now seen corresponding path program 1 times [2024-10-14 03:57:42,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:42,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536465875] [2024-10-14 03:57:42,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:42,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:42,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:42,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536465875] [2024-10-14 03:57:42,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536465875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:42,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:42,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:42,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846720782] [2024-10-14 03:57:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:42,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:42,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:42,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:42,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:42,288 INFO L87 Difference]: Start difference. First operand 546 states and 725 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:42,817 INFO L93 Difference]: Finished difference Result 956 states and 1289 transitions. [2024-10-14 03:57:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:42,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:42,819 INFO L225 Difference]: With dead ends: 956 [2024-10-14 03:57:42,819 INFO L226 Difference]: Without dead ends: 825 [2024-10-14 03:57:42,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:42,820 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1943 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1943 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:42,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1943 Valid, 1238 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-14 03:57:42,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-14 03:57:42,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3660377358490565) internal successors, (724), 545 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 724 transitions. [2024-10-14 03:57:42,830 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 724 transitions. Word has length 79 [2024-10-14 03:57:42,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:42,830 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 724 transitions. [2024-10-14 03:57:42,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:42,831 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 724 transitions. [2024-10-14 03:57:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:42,831 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:42,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:42,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 03:57:42,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1896793534, now seen corresponding path program 1 times [2024-10-14 03:57:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172329017] [2024-10-14 03:57:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:42,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:43,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:43,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172329017] [2024-10-14 03:57:43,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172329017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:43,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:43,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961594490] [2024-10-14 03:57:43,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:43,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:43,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:43,051 INFO L87 Difference]: Start difference. First operand 546 states and 724 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:43,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:43,561 INFO L93 Difference]: Finished difference Result 956 states and 1287 transitions. [2024-10-14 03:57:43,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:43,561 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:43,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:43,563 INFO L225 Difference]: With dead ends: 956 [2024-10-14 03:57:43,563 INFO L226 Difference]: Without dead ends: 825 [2024-10-14 03:57:43,564 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-14 03:57:43,564 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 1554 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:43,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1557 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:43,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2024-10-14 03:57:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 546. [2024-10-14 03:57:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 530 states have (on average 1.3641509433962264) internal successors, (723), 545 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 723 transitions. [2024-10-14 03:57:43,570 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 723 transitions. Word has length 79 [2024-10-14 03:57:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 723 transitions. [2024-10-14 03:57:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 723 transitions. [2024-10-14 03:57:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:43,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:43,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 03:57:43,572 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:43,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:43,572 INFO L85 PathProgramCache]: Analyzing trace with hash -485976660, now seen corresponding path program 1 times [2024-10-14 03:57:43,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:43,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086927511] [2024-10-14 03:57:43,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:43,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:43,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:43,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:43,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086927511] [2024-10-14 03:57:43,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086927511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:43,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:43,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:57:43,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227635412] [2024-10-14 03:57:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:43,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:57:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:57:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:57:43,874 INFO L87 Difference]: Start difference. First operand 546 states and 723 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:44,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:44,718 INFO L93 Difference]: Finished difference Result 1388 states and 1929 transitions. [2024-10-14 03:57:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:57:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:44,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:44,721 INFO L225 Difference]: With dead ends: 1388 [2024-10-14 03:57:44,721 INFO L226 Difference]: Without dead ends: 1245 [2024-10-14 03:57:44,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:57:44,722 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 3488 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3488 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:44,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3488 Valid, 1750 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:57:44,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2024-10-14 03:57:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 550. [2024-10-14 03:57:44,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3614232209737829) internal successors, (727), 549 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 727 transitions. [2024-10-14 03:57:44,729 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 727 transitions. Word has length 79 [2024-10-14 03:57:44,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:44,729 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 727 transitions. [2024-10-14 03:57:44,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:44,730 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 727 transitions. [2024-10-14 03:57:44,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:44,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:44,730 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:44,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 03:57:44,731 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:44,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:44,731 INFO L85 PathProgramCache]: Analyzing trace with hash -328806928, now seen corresponding path program 1 times [2024-10-14 03:57:44,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:44,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566550689] [2024-10-14 03:57:44,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:44,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:44,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:44,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566550689] [2024-10-14 03:57:44,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566550689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095258212] [2024-10-14 03:57:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:44,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:44,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:44,904 INFO L87 Difference]: Start difference. First operand 550 states and 727 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:45,441 INFO L93 Difference]: Finished difference Result 957 states and 1287 transitions. [2024-10-14 03:57:45,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:45,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:45,444 INFO L225 Difference]: With dead ends: 957 [2024-10-14 03:57:45,444 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:45,444 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-14 03:57:45,445 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1551 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:45,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1774 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:45,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3595505617977528) internal successors, (726), 549 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 726 transitions. [2024-10-14 03:57:45,453 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 726 transitions. Word has length 79 [2024-10-14 03:57:45,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:45,453 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 726 transitions. [2024-10-14 03:57:45,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 726 transitions. [2024-10-14 03:57:45,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:45,454 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:45,454 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:45,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 03:57:45,454 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:45,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 319887148, now seen corresponding path program 1 times [2024-10-14 03:57:45,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:45,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250291944] [2024-10-14 03:57:45,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:45,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:45,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:45,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250291944] [2024-10-14 03:57:45,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250291944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:45,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:45,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972605145] [2024-10-14 03:57:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:45,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:45,638 INFO L87 Difference]: Start difference. First operand 550 states and 726 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:46,155 INFO L93 Difference]: Finished difference Result 957 states and 1286 transitions. [2024-10-14 03:57:46,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:46,155 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:46,157 INFO L225 Difference]: With dead ends: 957 [2024-10-14 03:57:46,158 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:46,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:46,158 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 1935 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1935 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:46,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1935 Valid, 1238 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:46,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.357677902621723) internal successors, (725), 549 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 725 transitions. [2024-10-14 03:57:46,165 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 725 transitions. Word has length 79 [2024-10-14 03:57:46,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:46,165 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 725 transitions. [2024-10-14 03:57:46,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,165 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 725 transitions. [2024-10-14 03:57:46,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:46,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:46,166 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:46,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 03:57:46,166 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:46,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1334706002, now seen corresponding path program 1 times [2024-10-14 03:57:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902171167] [2024-10-14 03:57:46,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:46,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:46,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902171167] [2024-10-14 03:57:46,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902171167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:46,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:46,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:46,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320107203] [2024-10-14 03:57:46,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:46,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:46,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:46,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:46,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:46,331 INFO L87 Difference]: Start difference. First operand 550 states and 725 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:46,780 INFO L93 Difference]: Finished difference Result 955 states and 1282 transitions. [2024-10-14 03:57:46,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:46,780 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:46,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:46,782 INFO L225 Difference]: With dead ends: 955 [2024-10-14 03:57:46,782 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:46,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:57:46,783 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1081 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:46,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 1410 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:46,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3558052434456929) internal successors, (724), 549 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 724 transitions. [2024-10-14 03:57:46,802 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 724 transitions. Word has length 79 [2024-10-14 03:57:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 724 transitions. [2024-10-14 03:57:46,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 724 transitions. [2024-10-14 03:57:46,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:46,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:46,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:46,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 03:57:46,803 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:46,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1154349460, now seen corresponding path program 1 times [2024-10-14 03:57:46,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:46,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297276413] [2024-10-14 03:57:46,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:46,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297276413] [2024-10-14 03:57:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297276413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:46,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354354636] [2024-10-14 03:57:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:46,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:46,972 INFO L87 Difference]: Start difference. First operand 550 states and 724 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:47,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:47,422 INFO L93 Difference]: Finished difference Result 995 states and 1343 transitions. [2024-10-14 03:57:47,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:57:47,423 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:47,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:47,424 INFO L225 Difference]: With dead ends: 995 [2024-10-14 03:57:47,425 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 03:57:47,425 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-14 03:57:47,425 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1832 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:47,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 1456 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 03:57:47,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 550. [2024-10-14 03:57:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.352059925093633) internal successors, (722), 549 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 722 transitions. [2024-10-14 03:57:47,435 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 722 transitions. Word has length 79 [2024-10-14 03:57:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 722 transitions. [2024-10-14 03:57:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:47,435 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 722 transitions. [2024-10-14 03:57:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:47,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:47,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:47,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 03:57:47,436 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:47,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:47,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1228420734, now seen corresponding path program 1 times [2024-10-14 03:57:47,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:47,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714411626] [2024-10-14 03:57:47,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:47,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:47,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714411626] [2024-10-14 03:57:47,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714411626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:47,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924677485] [2024-10-14 03:57:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:47,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:47,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:47,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:47,605 INFO L87 Difference]: Start difference. First operand 550 states and 722 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:48,084 INFO L93 Difference]: Finished difference Result 963 states and 1288 transitions. [2024-10-14 03:57:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:48,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:48,086 INFO L225 Difference]: With dead ends: 963 [2024-10-14 03:57:48,086 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:48,090 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-14 03:57:48,090 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1537 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:48,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 1612 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:48,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.348314606741573) internal successors, (720), 549 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 720 transitions. [2024-10-14 03:57:48,096 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 720 transitions. Word has length 79 [2024-10-14 03:57:48,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:48,096 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 720 transitions. [2024-10-14 03:57:48,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 720 transitions. [2024-10-14 03:57:48,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:48,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:48,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:48,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 03:57:48,097 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:48,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:48,098 INFO L85 PathProgramCache]: Analyzing trace with hash -327266232, now seen corresponding path program 1 times [2024-10-14 03:57:48,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:48,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017664124] [2024-10-14 03:57:48,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:48,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:48,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:48,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017664124] [2024-10-14 03:57:48,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017664124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:48,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:48,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:48,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477806869] [2024-10-14 03:57:48,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:48,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:48,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:48,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:48,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:48,247 INFO L87 Difference]: Start difference. First operand 550 states and 720 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:48,700 INFO L93 Difference]: Finished difference Result 1071 states and 1439 transitions. [2024-10-14 03:57:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:48,700 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:48,702 INFO L225 Difference]: With dead ends: 1071 [2024-10-14 03:57:48,702 INFO L226 Difference]: Without dead ends: 881 [2024-10-14 03:57:48,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:48,703 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 1099 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1678 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:48,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1678 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:48,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2024-10-14 03:57:48,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 550. [2024-10-14 03:57:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.344569288389513) internal successors, (718), 549 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 718 transitions. [2024-10-14 03:57:48,710 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 718 transitions. Word has length 79 [2024-10-14 03:57:48,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:48,710 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 718 transitions. [2024-10-14 03:57:48,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:48,711 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 718 transitions. [2024-10-14 03:57:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:48,711 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:48,712 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:48,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 03:57:48,712 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:48,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:48,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1076267745, now seen corresponding path program 1 times [2024-10-14 03:57:48,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:48,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97672905] [2024-10-14 03:57:48,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:48,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97672905] [2024-10-14 03:57:48,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97672905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:48,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:48,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:48,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715338990] [2024-10-14 03:57:48,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:48,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:48,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:48,885 INFO L87 Difference]: Start difference. First operand 550 states and 718 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:49,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:49,379 INFO L93 Difference]: Finished difference Result 834 states and 1089 transitions. [2024-10-14 03:57:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:49,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:49,382 INFO L225 Difference]: With dead ends: 834 [2024-10-14 03:57:49,382 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:49,382 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-14 03:57:49,384 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1530 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:49,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 1612 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1126 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:49,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3408239700374531) internal successors, (716), 549 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:49,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 716 transitions. [2024-10-14 03:57:49,389 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 716 transitions. Word has length 79 [2024-10-14 03:57:49,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:49,390 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 716 transitions. [2024-10-14 03:57:49,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 716 transitions. [2024-10-14 03:57:49,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:49,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:49,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:49,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 03:57:49,391 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:49,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 835929357, now seen corresponding path program 1 times [2024-10-14 03:57:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:49,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872702977] [2024-10-14 03:57:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:49,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:49,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:49,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872702977] [2024-10-14 03:57:49,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872702977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:49,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:49,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:49,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991488330] [2024-10-14 03:57:49,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:49,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:49,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:49,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:49,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:49,545 INFO L87 Difference]: Start difference. First operand 550 states and 716 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:50,004 INFO L93 Difference]: Finished difference Result 862 states and 1131 transitions. [2024-10-14 03:57:50,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:50,004 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:50,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:50,006 INFO L225 Difference]: With dead ends: 862 [2024-10-14 03:57:50,006 INFO L226 Difference]: Without dead ends: 845 [2024-10-14 03:57:50,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:50,007 INFO L432 NwaCegarLoop]: 368 mSDtfsCounter, 1722 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1722 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:50,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1722 Valid, 1565 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:50,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2024-10-14 03:57:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 550. [2024-10-14 03:57:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3370786516853932) internal successors, (714), 549 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 714 transitions. [2024-10-14 03:57:50,013 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 714 transitions. Word has length 79 [2024-10-14 03:57:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:50,013 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 714 transitions. [2024-10-14 03:57:50,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 714 transitions. [2024-10-14 03:57:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:50,014 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:50,014 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:50,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 03:57:50,014 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:50,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:50,014 INFO L85 PathProgramCache]: Analyzing trace with hash -565396271, now seen corresponding path program 1 times [2024-10-14 03:57:50,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:50,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707509977] [2024-10-14 03:57:50,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:50,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:50,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707509977] [2024-10-14 03:57:50,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707509977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:50,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:50,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:50,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468152808] [2024-10-14 03:57:50,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:50,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:50,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:50,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:50,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:50,168 INFO L87 Difference]: Start difference. First operand 550 states and 714 transitions. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:50,595 INFO L93 Difference]: Finished difference Result 959 states and 1275 transitions. [2024-10-14 03:57:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:57:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:50,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:50,597 INFO L225 Difference]: With dead ends: 959 [2024-10-14 03:57:50,597 INFO L226 Difference]: Without dead ends: 829 [2024-10-14 03:57:50,598 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-14 03:57:50,598 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1523 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:50,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 1665 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-10-14 03:57:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 550. [2024-10-14 03:57:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3333333333333333) internal successors, (712), 549 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 712 transitions. [2024-10-14 03:57:50,604 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 712 transitions. Word has length 79 [2024-10-14 03:57:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:50,604 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 712 transitions. [2024-10-14 03:57:50,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 712 transitions. [2024-10-14 03:57:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-14 03:57:50,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:50,605 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:50,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 03:57:50,606 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:50,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:50,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1831404320, now seen corresponding path program 1 times [2024-10-14 03:57:50,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:50,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333145316] [2024-10-14 03:57:50,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:50,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:50,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333145316] [2024-10-14 03:57:50,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333145316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:50,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:50,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:57:50,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358544145] [2024-10-14 03:57:50,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:57:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:50,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:57:50,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:57:50,875 INFO L87 Difference]: Start difference. First operand 550 states and 712 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:51,562 INFO L93 Difference]: Finished difference Result 1154 states and 1555 transitions. [2024-10-14 03:57:51,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 03:57:51,562 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-10-14 03:57:51,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:51,565 INFO L225 Difference]: With dead ends: 1154 [2024-10-14 03:57:51,565 INFO L226 Difference]: Without dead ends: 1149 [2024-10-14 03:57:51,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:57:51,566 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 4042 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4042 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:51,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4042 Valid, 1387 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:57:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-10-14 03:57:51,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 558. [2024-10-14 03:57:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 542 states have (on average 1.3284132841328413) internal successors, (720), 557 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 720 transitions. [2024-10-14 03:57:51,572 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 720 transitions. Word has length 79 [2024-10-14 03:57:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:51,572 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 720 transitions. [2024-10-14 03:57:51,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 10 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 720 transitions. [2024-10-14 03:57:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:57:51,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:51,573 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:51,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 03:57:51,573 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -134038314, now seen corresponding path program 1 times [2024-10-14 03:57:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:51,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089760135] [2024-10-14 03:57:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:51,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:51,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:51,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089760135] [2024-10-14 03:57:51,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089760135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:51,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:51,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:51,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481145126] [2024-10-14 03:57:51,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:51,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:51,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:51,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:51,725 INFO L87 Difference]: Start difference. First operand 558 states and 720 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:52,164 INFO L93 Difference]: Finished difference Result 996 states and 1324 transitions. [2024-10-14 03:57:52,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:52,164 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-14 03:57:52,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:52,166 INFO L225 Difference]: With dead ends: 996 [2024-10-14 03:57:52,166 INFO L226 Difference]: Without dead ends: 853 [2024-10-14 03:57:52,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:52,166 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 1110 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:52,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1617 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-14 03:57:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 554. [2024-10-14 03:57:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 538 states have (on average 1.328996282527881) internal successors, (715), 553 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 715 transitions. [2024-10-14 03:57:52,172 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 715 transitions. Word has length 80 [2024-10-14 03:57:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 715 transitions. [2024-10-14 03:57:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 715 transitions. [2024-10-14 03:57:52,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:57:52,173 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:52,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:52,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 03:57:52,173 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash -234721971, now seen corresponding path program 1 times [2024-10-14 03:57:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737806889] [2024-10-14 03:57:52,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:52,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:52,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:52,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737806889] [2024-10-14 03:57:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737806889] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131078134] [2024-10-14 03:57:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:52,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:52,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:52,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:52,315 INFO L87 Difference]: Start difference. First operand 554 states and 715 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:52,798 INFO L93 Difference]: Finished difference Result 991 states and 1317 transitions. [2024-10-14 03:57:52,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:52,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-14 03:57:52,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:52,801 INFO L225 Difference]: With dead ends: 991 [2024-10-14 03:57:52,801 INFO L226 Difference]: Without dead ends: 853 [2024-10-14 03:57:52,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2024-10-14 03:57:52,801 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1651 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:52,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 1649 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-14 03:57:52,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 550. [2024-10-14 03:57:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 534 states have (on average 1.3295880149812733) internal successors, (710), 549 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 710 transitions. [2024-10-14 03:57:52,807 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 710 transitions. Word has length 80 [2024-10-14 03:57:52,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:52,807 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 710 transitions. [2024-10-14 03:57:52,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:52,808 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 710 transitions. [2024-10-14 03:57:52,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-14 03:57:52,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:52,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:52,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 03:57:52,809 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:52,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:52,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1205126979, now seen corresponding path program 1 times [2024-10-14 03:57:52,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:52,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759765512] [2024-10-14 03:57:52,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:52,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:52,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759765512] [2024-10-14 03:57:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759765512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:52,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:52,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:57:52,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338522651] [2024-10-14 03:57:52,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:52,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:57:52,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:57:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:57:52,957 INFO L87 Difference]: Start difference. First operand 550 states and 710 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:53,402 INFO L93 Difference]: Finished difference Result 826 states and 1071 transitions. [2024-10-14 03:57:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:57:53,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2024-10-14 03:57:53,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:53,404 INFO L225 Difference]: With dead ends: 826 [2024-10-14 03:57:53,404 INFO L226 Difference]: Without dead ends: 821 [2024-10-14 03:57:53,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:57:53,405 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 1174 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1174 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:53,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1174 Valid, 1426 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:57:53,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-10-14 03:57:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 542. [2024-10-14 03:57:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 526 states have (on average 1.3307984790874525) internal successors, (700), 541 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 700 transitions. [2024-10-14 03:57:53,410 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 700 transitions. Word has length 80 [2024-10-14 03:57:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:53,410 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 700 transitions. [2024-10-14 03:57:53,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:53,411 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 700 transitions. [2024-10-14 03:57:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:57:53,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:53,411 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:53,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 03:57:53,412 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:53,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1961223322, now seen corresponding path program 1 times [2024-10-14 03:57:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636448173] [2024-10-14 03:57:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:53,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:53,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:53,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636448173] [2024-10-14 03:57:53,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636448173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:53,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:53,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 03:57:53,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078355198] [2024-10-14 03:57:53,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:53,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 03:57:53,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:53,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 03:57:53,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:57:53,800 INFO L87 Difference]: Start difference. First operand 542 states and 700 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:54,070 INFO L93 Difference]: Finished difference Result 860 states and 1142 transitions. [2024-10-14 03:57:54,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:57:54,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:57:54,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:54,072 INFO L225 Difference]: With dead ends: 860 [2024-10-14 03:57:54,072 INFO L226 Difference]: Without dead ends: 617 [2024-10-14 03:57:54,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:57:54,073 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1569 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:54,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 1148 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:57:54,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-10-14 03:57:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 425. [2024-10-14 03:57:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 414 states have (on average 1.3357487922705313) internal successors, (553), 424 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 553 transitions. [2024-10-14 03:57:54,078 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 553 transitions. Word has length 81 [2024-10-14 03:57:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:54,078 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 553 transitions. [2024-10-14 03:57:54,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 553 transitions. [2024-10-14 03:57:54,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:57:54,078 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:54,078 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:54,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 03:57:54,079 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:54,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:54,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1832785083, now seen corresponding path program 1 times [2024-10-14 03:57:54,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:54,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183258040] [2024-10-14 03:57:54,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:54,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:54,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:54,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183258040] [2024-10-14 03:57:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183258040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:57:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265913253] [2024-10-14 03:57:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:54,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:57:54,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:57:54,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:57:54,470 INFO L87 Difference]: Start difference. First operand 425 states and 553 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:54,967 INFO L93 Difference]: Finished difference Result 767 states and 1037 transitions. [2024-10-14 03:57:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:57:54,967 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:57:54,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:54,968 INFO L225 Difference]: With dead ends: 767 [2024-10-14 03:57:54,969 INFO L226 Difference]: Without dead ends: 635 [2024-10-14 03:57:54,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:57:54,969 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1816 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1816 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:54,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1816 Valid, 1616 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:54,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-14 03:57:54,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 413. [2024-10-14 03:57:54,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 403 states have (on average 1.3300248138957815) internal successors, (536), 412 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 536 transitions. [2024-10-14 03:57:54,977 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 536 transitions. Word has length 81 [2024-10-14 03:57:54,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:54,977 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 536 transitions. [2024-10-14 03:57:54,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:54,978 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 536 transitions. [2024-10-14 03:57:54,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:57:54,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:54,978 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:54,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 03:57:54,978 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:54,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:54,979 INFO L85 PathProgramCache]: Analyzing trace with hash 52267935, now seen corresponding path program 1 times [2024-10-14 03:57:54,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:54,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861053233] [2024-10-14 03:57:54,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:54,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:55,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:55,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:55,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861053233] [2024-10-14 03:57:55,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861053233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:55,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:55,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:57:55,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448751788] [2024-10-14 03:57:55,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:55,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:57:55,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:55,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:57:55,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:57:55,309 INFO L87 Difference]: Start difference. First operand 413 states and 536 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:55,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:55,689 INFO L93 Difference]: Finished difference Result 743 states and 1015 transitions. [2024-10-14 03:57:55,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:57:55,690 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:57:55,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:55,691 INFO L225 Difference]: With dead ends: 743 [2024-10-14 03:57:55,691 INFO L226 Difference]: Without dead ends: 575 [2024-10-14 03:57:55,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:57:55,691 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 1399 mSDsluCounter, 2066 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:55,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 2442 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:57:55,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-10-14 03:57:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 371. [2024-10-14 03:57:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 363 states have (on average 1.3278236914600552) internal successors, (482), 370 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 482 transitions. [2024-10-14 03:57:55,696 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 482 transitions. Word has length 81 [2024-10-14 03:57:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:55,696 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 482 transitions. [2024-10-14 03:57:55,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 482 transitions. [2024-10-14 03:57:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:57:55,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:55,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:55,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 03:57:55,697 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:55,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1340490679, now seen corresponding path program 1 times [2024-10-14 03:57:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:55,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870762612] [2024-10-14 03:57:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:56,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:56,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:56,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870762612] [2024-10-14 03:57:56,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870762612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:56,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2024-10-14 03:57:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603280686] [2024-10-14 03:57:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:56,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:57:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:57:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:57:56,951 INFO L87 Difference]: Start difference. First operand 371 states and 482 transitions. Second operand has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:58,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:57:58,717 INFO L93 Difference]: Finished difference Result 713 states and 968 transitions. [2024-10-14 03:57:58,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-14 03:57:58,718 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:57:58,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:57:58,718 INFO L225 Difference]: With dead ends: 713 [2024-10-14 03:57:58,719 INFO L226 Difference]: Without dead ends: 583 [2024-10-14 03:57:58,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=404, Invalid=2248, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 03:57:58,720 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1018 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 4090 SdHoareTripleChecker+Invalid, 2493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:57:58,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 4090 Invalid, 2493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:57:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-10-14 03:57:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 386. [2024-10-14 03:57:58,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 378 states have (on average 1.3306878306878307) internal successors, (503), 385 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:58,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 503 transitions. [2024-10-14 03:57:58,723 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 503 transitions. Word has length 81 [2024-10-14 03:57:58,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:57:58,723 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 503 transitions. [2024-10-14 03:57:58,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.793103448275862) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:57:58,724 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 503 transitions. [2024-10-14 03:57:58,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:57:58,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:57:58,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:57:58,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 03:57:58,724 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:57:58,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:57:58,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1064681092, now seen corresponding path program 1 times [2024-10-14 03:57:58,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:57:58,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697920216] [2024-10-14 03:57:58,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:57:58,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:57:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:57:59,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:57:59,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:57:59,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697920216] [2024-10-14 03:57:59,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697920216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:57:59,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:57:59,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-10-14 03:57:59,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092311476] [2024-10-14 03:57:59,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:57:59,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-14 03:57:59,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:57:59,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-14 03:57:59,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2024-10-14 03:57:59,604 INFO L87 Difference]: Start difference. First operand 386 states and 503 transitions. Second operand has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:00,791 INFO L93 Difference]: Finished difference Result 757 states and 1028 transitions. [2024-10-14 03:58:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 03:58:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:58:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:00,793 INFO L225 Difference]: With dead ends: 757 [2024-10-14 03:58:00,793 INFO L226 Difference]: Without dead ends: 597 [2024-10-14 03:58:00,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=274, Invalid=1286, Unknown=0, NotChecked=0, Total=1560 [2024-10-14 03:58:00,793 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 804 mSDsluCounter, 3749 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:00,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 4045 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:58:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-10-14 03:58:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 392. [2024-10-14 03:58:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 384 states have (on average 1.3255208333333333) internal successors, (509), 391 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:00,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 509 transitions. [2024-10-14 03:58:00,797 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 509 transitions. Word has length 81 [2024-10-14 03:58:00,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:00,797 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 509 transitions. [2024-10-14 03:58:00,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 21 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:00,798 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 509 transitions. [2024-10-14 03:58:00,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-14 03:58:00,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:00,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:00,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 03:58:00,799 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:00,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:00,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1002840708, now seen corresponding path program 1 times [2024-10-14 03:58:00,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:00,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480016144] [2024-10-14 03:58:00,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:00,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:01,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:01,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480016144] [2024-10-14 03:58:01,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480016144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:58:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843584593] [2024-10-14 03:58:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:01,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:58:01,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:58:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:58:01,098 INFO L87 Difference]: Start difference. First operand 392 states and 509 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:01,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:01,502 INFO L93 Difference]: Finished difference Result 717 states and 980 transitions. [2024-10-14 03:58:01,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 03:58:01,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-14 03:58:01,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:01,503 INFO L225 Difference]: With dead ends: 717 [2024-10-14 03:58:01,503 INFO L226 Difference]: Without dead ends: 549 [2024-10-14 03:58:01,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:58:01,504 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 1224 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:01,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 2000 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:58:01,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2024-10-14 03:58:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 350. [2024-10-14 03:58:01,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 343 states have (on average 1.3236151603498543) internal successors, (454), 349 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 454 transitions. [2024-10-14 03:58:01,507 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 454 transitions. Word has length 81 [2024-10-14 03:58:01,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:01,507 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 454 transitions. [2024-10-14 03:58:01,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:01,508 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 454 transitions. [2024-10-14 03:58:01,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:01,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:01,508 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:01,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 03:58:01,508 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:01,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1580070937, now seen corresponding path program 1 times [2024-10-14 03:58:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:01,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626799006] [2024-10-14 03:58:01,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626799006] [2024-10-14 03:58:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626799006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:02,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 03:58:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697537399] [2024-10-14 03:58:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:02,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:58:02,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:02,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:58:02,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:58:02,068 INFO L87 Difference]: Start difference. First operand 350 states and 454 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:03,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:03,054 INFO L93 Difference]: Finished difference Result 828 states and 1126 transitions. [2024-10-14 03:58:03,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:03,054 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:03,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:03,055 INFO L225 Difference]: With dead ends: 828 [2024-10-14 03:58:03,055 INFO L226 Difference]: Without dead ends: 698 [2024-10-14 03:58:03,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=184, Invalid=572, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:58:03,056 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 1974 mSDsluCounter, 1798 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1974 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:03,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1974 Valid, 2039 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:58:03,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2024-10-14 03:58:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 344. [2024-10-14 03:58:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 337 states have (on average 1.317507418397626) internal successors, (444), 343 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 444 transitions. [2024-10-14 03:58:03,059 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 444 transitions. Word has length 82 [2024-10-14 03:58:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:03,060 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 444 transitions. [2024-10-14 03:58:03,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 444 transitions. [2024-10-14 03:58:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:03,060 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:03,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:03,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 03:58:03,061 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:03,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:03,061 INFO L85 PathProgramCache]: Analyzing trace with hash -814304105, now seen corresponding path program 1 times [2024-10-14 03:58:03,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:03,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621369587] [2024-10-14 03:58:03,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:03,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:03,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621369587] [2024-10-14 03:58:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621369587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-14 03:58:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583696463] [2024-10-14 03:58:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:03,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 03:58:03,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 03:58:03,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2024-10-14 03:58:03,947 INFO L87 Difference]: Start difference. First operand 344 states and 444 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:05,075 INFO L93 Difference]: Finished difference Result 501 states and 673 transitions. [2024-10-14 03:58:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-14 03:58:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:05,076 INFO L225 Difference]: With dead ends: 501 [2024-10-14 03:58:05,076 INFO L226 Difference]: Without dead ends: 371 [2024-10-14 03:58:05,077 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=1111, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 03:58:05,077 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 521 mSDsluCounter, 2836 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 3023 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:05,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 3023 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:58:05,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-14 03:58:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 345. [2024-10-14 03:58:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 338 states have (on average 1.316568047337278) internal successors, (445), 344 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 445 transitions. [2024-10-14 03:58:05,080 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 445 transitions. Word has length 82 [2024-10-14 03:58:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:05,081 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 445 transitions. [2024-10-14 03:58:05,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 20 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 445 transitions. [2024-10-14 03:58:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:05,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:05,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:05,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 03:58:05,082 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:05,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:05,082 INFO L85 PathProgramCache]: Analyzing trace with hash -678951119, now seen corresponding path program 1 times [2024-10-14 03:58:05,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:05,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632457188] [2024-10-14 03:58:05,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:05,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:05,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632457188] [2024-10-14 03:58:05,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632457188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:05,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:05,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613523777] [2024-10-14 03:58:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:05,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:05,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:05,234 INFO L87 Difference]: Start difference. First operand 345 states and 445 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:05,538 INFO L93 Difference]: Finished difference Result 532 states and 701 transitions. [2024-10-14 03:58:05,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:05,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:05,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:05,539 INFO L225 Difference]: With dead ends: 532 [2024-10-14 03:58:05,539 INFO L226 Difference]: Without dead ends: 525 [2024-10-14 03:58:05,539 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-14 03:58:05,539 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 799 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:05,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 817 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:58:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-10-14 03:58:05,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 345. [2024-10-14 03:58:05,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 338 states have (on average 1.3106508875739644) internal successors, (443), 344 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 443 transitions. [2024-10-14 03:58:05,543 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 443 transitions. Word has length 82 [2024-10-14 03:58:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 443 transitions. [2024-10-14 03:58:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 7 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 443 transitions. [2024-10-14 03:58:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:05,543 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:05,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:05,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 03:58:05,544 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:05,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:05,544 INFO L85 PathProgramCache]: Analyzing trace with hash -748534451, now seen corresponding path program 1 times [2024-10-14 03:58:05,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:05,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313739806] [2024-10-14 03:58:05,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:05,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:05,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:05,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313739806] [2024-10-14 03:58:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313739806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 03:58:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812812849] [2024-10-14 03:58:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 03:58:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:05,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 03:58:05,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:05,772 INFO L87 Difference]: Start difference. First operand 345 states and 443 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:06,324 INFO L93 Difference]: Finished difference Result 1119 states and 1559 transitions. [2024-10-14 03:58:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:06,326 INFO L225 Difference]: With dead ends: 1119 [2024-10-14 03:58:06,326 INFO L226 Difference]: Without dead ends: 963 [2024-10-14 03:58:06,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:58:06,327 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 2086 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:06,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1156 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 03:58:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-14 03:58:06,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 357. [2024-10-14 03:58:06,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 350 states have (on average 1.3) internal successors, (455), 356 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 455 transitions. [2024-10-14 03:58:06,331 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 455 transitions. Word has length 82 [2024-10-14 03:58:06,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:06,331 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 455 transitions. [2024-10-14 03:58:06,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 10 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:06,331 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 455 transitions. [2024-10-14 03:58:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:06,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:06,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:06,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 03:58:06,331 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash -689786806, now seen corresponding path program 1 times [2024-10-14 03:58:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980733483] [2024-10-14 03:58:06,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:06,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980733483] [2024-10-14 03:58:06,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980733483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:06,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:06,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:58:06,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584050557] [2024-10-14 03:58:06,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:06,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:58:06,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:06,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:58:06,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:58:06,668 INFO L87 Difference]: Start difference. First operand 357 states and 455 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:07,149 INFO L93 Difference]: Finished difference Result 999 states and 1376 transitions. [2024-10-14 03:58:07,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 03:58:07,150 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:07,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:07,151 INFO L225 Difference]: With dead ends: 999 [2024-10-14 03:58:07,151 INFO L226 Difference]: Without dead ends: 853 [2024-10-14 03:58:07,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:58:07,151 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 1793 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2099 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:07,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2099 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:58:07,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2024-10-14 03:58:07,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 321. [2024-10-14 03:58:07,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 316 states have (on average 1.3006329113924051) internal successors, (411), 320 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 411 transitions. [2024-10-14 03:58:07,155 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 411 transitions. Word has length 82 [2024-10-14 03:58:07,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:07,156 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 411 transitions. [2024-10-14 03:58:07,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,156 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 411 transitions. [2024-10-14 03:58:07,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-14 03:58:07,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:07,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:07,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-14 03:58:07,157 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:07,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:07,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1693741357, now seen corresponding path program 1 times [2024-10-14 03:58:07,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:07,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897194227] [2024-10-14 03:58:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:07,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:07,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:07,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:07,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897194227] [2024-10-14 03:58:07,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897194227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:07,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:07,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 03:58:07,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065138204] [2024-10-14 03:58:07,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:07,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 03:58:07,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 03:58:07,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-14 03:58:07,515 INFO L87 Difference]: Start difference. First operand 321 states and 411 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:07,915 INFO L93 Difference]: Finished difference Result 637 states and 866 transitions. [2024-10-14 03:58:07,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:07,916 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2024-10-14 03:58:07,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:07,916 INFO L225 Difference]: With dead ends: 637 [2024-10-14 03:58:07,916 INFO L226 Difference]: Without dead ends: 451 [2024-10-14 03:58:07,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:58:07,917 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 466 mSDsluCounter, 2331 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:07,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2627 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:58:07,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-10-14 03:58:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 261. [2024-10-14 03:58:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 259 states have (on average 1.308880308880309) internal successors, (339), 260 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 339 transitions. [2024-10-14 03:58:07,920 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 339 transitions. Word has length 82 [2024-10-14 03:58:07,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:07,920 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 339 transitions. [2024-10-14 03:58:07,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 12 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:07,920 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 339 transitions. [2024-10-14 03:58:07,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 03:58:07,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:07,921 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] [2024-10-14 03:58:07,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-14 03:58:07,921 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:07,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:07,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1172303981, now seen corresponding path program 1 times [2024-10-14 03:58:07,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:07,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113812594] [2024-10-14 03:58:07,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:07,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:08,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:08,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:08,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113812594] [2024-10-14 03:58:08,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113812594] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:08,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:08,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:08,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747787579] [2024-10-14 03:58:08,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:08,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 03:58:08,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:08,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 03:58:08,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:58:08,063 INFO L87 Difference]: Start difference. First operand 261 states and 339 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:08,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:08,325 INFO L93 Difference]: Finished difference Result 583 states and 801 transitions. [2024-10-14 03:58:08,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 03:58:08,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2024-10-14 03:58:08,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:08,326 INFO L225 Difference]: With dead ends: 583 [2024-10-14 03:58:08,326 INFO L226 Difference]: Without dead ends: 427 [2024-10-14 03:58:08,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-14 03:58:08,327 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 411 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:08,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 762 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 03:58:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-14 03:58:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 253. [2024-10-14 03:58:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 251 states have (on average 1.3107569721115537) internal successors, (329), 252 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 329 transitions. [2024-10-14 03:58:08,330 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 329 transitions. Word has length 83 [2024-10-14 03:58:08,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:08,330 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 329 transitions. [2024-10-14 03:58:08,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 329 transitions. [2024-10-14 03:58:08,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 03:58:08,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:08,330 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] [2024-10-14 03:58:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-14 03:58:08,330 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:08,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:08,331 INFO L85 PathProgramCache]: Analyzing trace with hash -633529937, now seen corresponding path program 1 times [2024-10-14 03:58:08,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216518362] [2024-10-14 03:58:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216518362] [2024-10-14 03:58:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216518362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-10-14 03:58:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157533707] [2024-10-14 03:58:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:09,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 03:58:09,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 03:58:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2024-10-14 03:58:09,128 INFO L87 Difference]: Start difference. First operand 253 states and 329 transitions. Second operand has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:10,227 INFO L93 Difference]: Finished difference Result 410 states and 554 transitions. [2024-10-14 03:58:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-14 03:58:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2024-10-14 03:58:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:10,228 INFO L225 Difference]: With dead ends: 410 [2024-10-14 03:58:10,228 INFO L226 Difference]: Without dead ends: 271 [2024-10-14 03:58:10,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 03:58:10,229 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 485 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:10,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 2477 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:58:10,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-10-14 03:58:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2024-10-14 03:58:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.303370786516854) internal successors, (348), 268 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 348 transitions. [2024-10-14 03:58:10,231 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 348 transitions. Word has length 84 [2024-10-14 03:58:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:10,232 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 348 transitions. [2024-10-14 03:58:10,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.230769230769231) internal successors, (84), 26 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 348 transitions. [2024-10-14 03:58:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 03:58:10,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:10,232 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] [2024-10-14 03:58:10,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-14 03:58:10,232 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:10,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:10,232 INFO L85 PathProgramCache]: Analyzing trace with hash 362850175, now seen corresponding path program 1 times [2024-10-14 03:58:10,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:10,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948334293] [2024-10-14 03:58:10,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:10,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:10,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:10,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948334293] [2024-10-14 03:58:10,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948334293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:10,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:10,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 03:58:10,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094334209] [2024-10-14 03:58:10,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:10,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 03:58:10,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:10,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 03:58:10,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-14 03:58:10,685 INFO L87 Difference]: Start difference. First operand 269 states and 348 transitions. Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:11,480 INFO L93 Difference]: Finished difference Result 573 states and 784 transitions. [2024-10-14 03:58:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 03:58:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-14 03:58:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:11,482 INFO L225 Difference]: With dead ends: 573 [2024-10-14 03:58:11,482 INFO L226 Difference]: Without dead ends: 567 [2024-10-14 03:58:11,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=669, Unknown=0, NotChecked=0, Total=870 [2024-10-14 03:58:11,482 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1090 mSDsluCounter, 2199 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:11,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 2473 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 03:58:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-14 03:58:11,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 269. [2024-10-14 03:58:11,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.299625468164794) internal successors, (347), 268 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 347 transitions. [2024-10-14 03:58:11,485 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 347 transitions. Word has length 85 [2024-10-14 03:58:11,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:11,485 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 347 transitions. [2024-10-14 03:58:11,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 14 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:11,485 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 347 transitions. [2024-10-14 03:58:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-14 03:58:11,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:11,486 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] [2024-10-14 03:58:11,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-14 03:58:11,486 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:11,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1543734065, now seen corresponding path program 1 times [2024-10-14 03:58:11,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:11,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535927853] [2024-10-14 03:58:11,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:11,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:11,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535927853] [2024-10-14 03:58:11,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535927853] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:11,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:11,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 03:58:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178074707] [2024-10-14 03:58:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:11,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 03:58:11,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:11,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 03:58:11,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:58:11,766 INFO L87 Difference]: Start difference. First operand 269 states and 347 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,072 INFO L93 Difference]: Finished difference Result 421 states and 568 transitions. [2024-10-14 03:58:12,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:58:12,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 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 85 [2024-10-14 03:58:12,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,073 INFO L225 Difference]: With dead ends: 421 [2024-10-14 03:58:12,073 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 03:58:12,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-10-14 03:58:12,073 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 682 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1526 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:58:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 03:58:12,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 262. [2024-10-14 03:58:12,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 1.3026819923371646) internal successors, (340), 261 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 340 transitions. [2024-10-14 03:58:12,076 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 340 transitions. Word has length 85 [2024-10-14 03:58:12,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,076 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 340 transitions. [2024-10-14 03:58:12,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 11 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,076 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 340 transitions. [2024-10-14 03:58:12,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 03:58:12,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,077 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] [2024-10-14 03:58:12,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-14 03:58:12,077 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1137760319, now seen corresponding path program 1 times [2024-10-14 03:58:12,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439998009] [2024-10-14 03:58:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439998009] [2024-10-14 03:58:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439998009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:12,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594400983] [2024-10-14 03:58:12,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:12,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:12,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:12,166 INFO L87 Difference]: Start difference. First operand 262 states and 340 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,269 INFO L93 Difference]: Finished difference Result 1522 states and 2240 transitions. [2024-10-14 03:58:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 03:58:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-10-14 03:58:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,271 INFO L225 Difference]: With dead ends: 1522 [2024-10-14 03:58:12,271 INFO L226 Difference]: Without dead ends: 1396 [2024-10-14 03:58:12,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2024-10-14 03:58:12,272 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1497 mSDsluCounter, 1354 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 1540 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:58:12,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-14 03:58:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 386. [2024-10-14 03:58:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 385 states have (on average 1.3636363636363635) internal successors, (525), 385 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 525 transitions. [2024-10-14 03:58:12,278 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 525 transitions. Word has length 111 [2024-10-14 03:58:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,278 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 525 transitions. [2024-10-14 03:58:12,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 7 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 525 transitions. [2024-10-14 03:58:12,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:12,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,279 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] [2024-10-14 03:58:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-14 03:58:12,279 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,280 INFO L85 PathProgramCache]: Analyzing trace with hash 306859352, now seen corresponding path program 1 times [2024-10-14 03:58:12,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566565818] [2024-10-14 03:58:12,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:12,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566565818] [2024-10-14 03:58:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566565818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524898257] [2024-10-14 03:58:12,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:12,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:12,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:12,368 INFO L87 Difference]: Start difference. First operand 386 states and 525 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,440 INFO L93 Difference]: Finished difference Result 1762 states and 2586 transitions. [2024-10-14 03:58:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,442 INFO L225 Difference]: With dead ends: 1762 [2024-10-14 03:58:12,442 INFO L226 Difference]: Without dead ends: 1512 [2024-10-14 03:58:12,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:12,443 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 1197 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 945 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:12,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-10-14 03:58:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 634. [2024-10-14 03:58:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.4170616113744077) internal successors, (897), 633 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 897 transitions. [2024-10-14 03:58:12,449 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 897 transitions. Word has length 113 [2024-10-14 03:58:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,449 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 897 transitions. [2024-10-14 03:58:12,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 897 transitions. [2024-10-14 03:58:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,450 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] [2024-10-14 03:58:12,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-14 03:58:12,450 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,451 INFO L85 PathProgramCache]: Analyzing trace with hash 2032245473, now seen corresponding path program 1 times [2024-10-14 03:58:12,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299294515] [2024-10-14 03:58:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:12,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299294515] [2024-10-14 03:58:12,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299294515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:12,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854301853] [2024-10-14 03:58:12,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:12,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:12,597 INFO L87 Difference]: Start difference. First operand 634 states and 897 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,678 INFO L93 Difference]: Finished difference Result 1134 states and 1645 transitions. [2024-10-14 03:58:12,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:12,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:12,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,679 INFO L225 Difference]: With dead ends: 1134 [2024-10-14 03:58:12,679 INFO L226 Difference]: Without dead ends: 636 [2024-10-14 03:58:12,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-10-14 03:58:12,680 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 252 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 552 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:12,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-14 03:58:12,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2024-10-14 03:58:12,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 1.410742496050553) internal successors, (893), 633 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 893 transitions. [2024-10-14 03:58:12,685 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 893 transitions. Word has length 113 [2024-10-14 03:58:12,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,685 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 893 transitions. [2024-10-14 03:58:12,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,685 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 893 transitions. [2024-10-14 03:58:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:12,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,686 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] [2024-10-14 03:58:12,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-14 03:58:12,686 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1292505152, now seen corresponding path program 1 times [2024-10-14 03:58:12,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779015935] [2024-10-14 03:58:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:12,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779015935] [2024-10-14 03:58:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779015935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135222917] [2024-10-14 03:58:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:12,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:12,731 INFO L87 Difference]: Start difference. First operand 634 states and 893 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,748 INFO L93 Difference]: Finished difference Result 1578 states and 2291 transitions. [2024-10-14 03:58:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,750 INFO L225 Difference]: With dead ends: 1578 [2024-10-14 03:58:12,750 INFO L226 Difference]: Without dead ends: 1080 [2024-10-14 03:58:12,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:12,750 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 112 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 306 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2024-10-14 03:58:12,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 1070. [2024-10-14 03:58:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1069 states have (on average 1.420954162768943) internal successors, (1519), 1069 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1519 transitions. [2024-10-14 03:58:12,758 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1519 transitions. Word has length 113 [2024-10-14 03:58:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,758 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1519 transitions. [2024-10-14 03:58:12,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1519 transitions. [2024-10-14 03:58:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:12,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,759 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] [2024-10-14 03:58:12,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-14 03:58:12,759 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash 385060138, now seen corresponding path program 1 times [2024-10-14 03:58:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37719430] [2024-10-14 03:58:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:12,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:12,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:12,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37719430] [2024-10-14 03:58:12,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37719430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:12,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248530064] [2024-10-14 03:58:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:12,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:12,853 INFO L87 Difference]: Start difference. First operand 1070 states and 1519 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:12,929 INFO L93 Difference]: Finished difference Result 3646 states and 5295 transitions. [2024-10-14 03:58:12,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:12,932 INFO L225 Difference]: With dead ends: 3646 [2024-10-14 03:58:12,932 INFO L226 Difference]: Without dead ends: 3178 [2024-10-14 03:58:12,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:12,933 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1118 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:12,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 1020 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3178 states. [2024-10-14 03:58:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3178 to 1770. [2024-10-14 03:58:12,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.4364047484454494) internal successors, (2541), 1769 states have internal predecessors, (2541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2541 transitions. [2024-10-14 03:58:12,948 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2541 transitions. Word has length 113 [2024-10-14 03:58:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:12,949 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2541 transitions. [2024-10-14 03:58:12,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2541 transitions. [2024-10-14 03:58:12,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:12,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:12,950 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] [2024-10-14 03:58:12,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-14 03:58:12,950 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:12,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:12,950 INFO L85 PathProgramCache]: Analyzing trace with hash -734359452, now seen corresponding path program 1 times [2024-10-14 03:58:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:12,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37306226] [2024-10-14 03:58:12,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:12,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:13,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37306226] [2024-10-14 03:58:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37306226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:13,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250504959] [2024-10-14 03:58:13,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:13,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:13,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:13,040 INFO L87 Difference]: Start difference. First operand 1770 states and 2541 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,116 INFO L93 Difference]: Finished difference Result 4112 states and 5977 transitions. [2024-10-14 03:58:13,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:13,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:13,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,120 INFO L225 Difference]: With dead ends: 4112 [2024-10-14 03:58:13,120 INFO L226 Difference]: Without dead ends: 3644 [2024-10-14 03:58:13,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:13,122 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1013 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:13,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1068 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2024-10-14 03:58:13,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 2236. [2024-10-14 03:58:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2236 states, 2235 states have (on average 1.4420581655480984) internal successors, (3223), 2235 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2236 states to 2236 states and 3223 transitions. [2024-10-14 03:58:13,140 INFO L78 Accepts]: Start accepts. Automaton has 2236 states and 3223 transitions. Word has length 113 [2024-10-14 03:58:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 2236 states and 3223 transitions. [2024-10-14 03:58:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 2236 states and 3223 transitions. [2024-10-14 03:58:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 03:58:13,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,142 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] [2024-10-14 03:58:13,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-10-14 03:58:13,142 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:13,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash -601785570, now seen corresponding path program 1 times [2024-10-14 03:58:13,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826719250] [2024-10-14 03:58:13,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:13,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:13,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826719250] [2024-10-14 03:58:13,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826719250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:13,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224891223] [2024-10-14 03:58:13,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:13,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:13,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:13,233 INFO L87 Difference]: Start difference. First operand 2236 states and 3223 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,325 INFO L93 Difference]: Finished difference Result 4578 states and 6659 transitions. [2024-10-14 03:58:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:13,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-10-14 03:58:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,329 INFO L225 Difference]: With dead ends: 4578 [2024-10-14 03:58:13,329 INFO L226 Difference]: Without dead ends: 4110 [2024-10-14 03:58:13,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:13,330 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 1048 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:13,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1117 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:58:13,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4110 states. [2024-10-14 03:58:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4110 to 2702. [2024-10-14 03:58:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2702 states, 2701 states have (on average 1.445760829322473) internal successors, (3905), 2701 states have internal predecessors, (3905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2702 states to 2702 states and 3905 transitions. [2024-10-14 03:58:13,350 INFO L78 Accepts]: Start accepts. Automaton has 2702 states and 3905 transitions. Word has length 113 [2024-10-14 03:58:13,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,351 INFO L471 AbstractCegarLoop]: Abstraction has 2702 states and 3905 transitions. [2024-10-14 03:58:13,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2702 states and 3905 transitions. [2024-10-14 03:58:13,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 03:58:13,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:13,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-10-14 03:58:13,353 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:13,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:13,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1484067262, now seen corresponding path program 1 times [2024-10-14 03:58:13,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:13,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152299452] [2024-10-14 03:58:13,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:13,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:13,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152299452] [2024-10-14 03:58:13,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152299452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:13,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049568602] [2024-10-14 03:58:13,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:13,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:13,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,420 INFO L87 Difference]: Start difference. First operand 2702 states and 3905 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,461 INFO L93 Difference]: Finished difference Result 7658 states and 11107 transitions. [2024-10-14 03:58:13,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:13,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-14 03:58:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,464 INFO L225 Difference]: With dead ends: 7658 [2024-10-14 03:58:13,464 INFO L226 Difference]: Without dead ends: 5092 [2024-10-14 03:58:13,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,466 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:13,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:13,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5092 states. [2024-10-14 03:58:13,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5092 to 4914. [2024-10-14 03:58:13,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4914 states, 4913 states have (on average 1.4424994911459394) internal successors, (7087), 4913 states have internal predecessors, (7087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4914 states to 4914 states and 7087 transitions. [2024-10-14 03:58:13,496 INFO L78 Accepts]: Start accepts. Automaton has 4914 states and 7087 transitions. Word has length 114 [2024-10-14 03:58:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,496 INFO L471 AbstractCegarLoop]: Abstraction has 4914 states and 7087 transitions. [2024-10-14 03:58:13,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4914 states and 7087 transitions. [2024-10-14 03:58:13,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 03:58:13,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,497 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] [2024-10-14 03:58:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-10-14 03:58:13,498 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:13,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -880880022, now seen corresponding path program 1 times [2024-10-14 03:58:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100263793] [2024-10-14 03:58:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:13,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100263793] [2024-10-14 03:58:13,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100263793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66006129] [2024-10-14 03:58:13,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:13,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:13,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,566 INFO L87 Difference]: Start difference. First operand 4914 states and 7087 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,598 INFO L93 Difference]: Finished difference Result 14118 states and 20345 transitions. [2024-10-14 03:58:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-10-14 03:58:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,605 INFO L225 Difference]: With dead ends: 14118 [2024-10-14 03:58:13,605 INFO L226 Difference]: Without dead ends: 9340 [2024-10-14 03:58:13,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,609 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 83 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:13,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2024-10-14 03:58:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 8986. [2024-10-14 03:58:13,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8986 states, 8985 states have (on average 1.43338898163606) internal successors, (12879), 8985 states have internal predecessors, (12879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8986 states to 8986 states and 12879 transitions. [2024-10-14 03:58:13,671 INFO L78 Accepts]: Start accepts. Automaton has 8986 states and 12879 transitions. Word has length 115 [2024-10-14 03:58:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 8986 states and 12879 transitions. [2024-10-14 03:58:13,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 8986 states and 12879 transitions. [2024-10-14 03:58:13,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 03:58:13,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,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] [2024-10-14 03:58:13,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-10-14 03:58:13,673 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1627793619, now seen corresponding path program 1 times [2024-10-14 03:58:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624246146] [2024-10-14 03:58:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:13,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:13,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624246146] [2024-10-14 03:58:13,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624246146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:13,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:13,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:13,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883676467] [2024-10-14 03:58:13,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:13,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:13,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:13,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,743 INFO L87 Difference]: Start difference. First operand 8986 states and 12879 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-14 03:58:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:13,788 INFO L93 Difference]: Finished difference Result 25982 states and 37105 transitions. [2024-10-14 03:58:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:13,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-14 03:58:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:13,802 INFO L225 Difference]: With dead ends: 25982 [2024-10-14 03:58:13,802 INFO L226 Difference]: Without dead ends: 17132 [2024-10-14 03:58:13,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:13,812 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 76 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:13,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 407 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17132 states. [2024-10-14 03:58:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17132 to 16426. [2024-10-14 03:58:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16426 states, 16425 states have (on average 1.4197260273972603) internal successors, (23319), 16425 states have internal predecessors, (23319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16426 states to 16426 states and 23319 transitions. [2024-10-14 03:58:13,997 INFO L78 Accepts]: Start accepts. Automaton has 16426 states and 23319 transitions. Word has length 116 [2024-10-14 03:58:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:13,998 INFO L471 AbstractCegarLoop]: Abstraction has 16426 states and 23319 transitions. [2024-10-14 03:58:13,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 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-14 03:58:13,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16426 states and 23319 transitions. [2024-10-14 03:58:13,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 03:58:13,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:13,999 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-14 03:58:13,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-10-14 03:58:13,999 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:14,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1521009111, now seen corresponding path program 1 times [2024-10-14 03:58:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:14,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14513043] [2024-10-14 03:58:14,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:14,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:14,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:14,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:14,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14513043] [2024-10-14 03:58:14,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14513043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:14,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:14,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:14,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260529136] [2024-10-14 03:58:14,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:14,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:14,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:14,073 INFO L87 Difference]: Start difference. First operand 16426 states and 23319 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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-14 03:58:14,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:14,147 INFO L93 Difference]: Finished difference Result 47598 states and 67193 transitions. [2024-10-14 03:58:14,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:14,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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-14 03:58:14,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:14,175 INFO L225 Difference]: With dead ends: 47598 [2024-10-14 03:58:14,175 INFO L226 Difference]: Without dead ends: 31308 [2024-10-14 03:58:14,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:14,192 INFO L432 NwaCegarLoop]: 232 mSDtfsCounter, 66 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:14,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 407 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:14,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31308 states. [2024-10-14 03:58:14,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31308 to 29898. [2024-10-14 03:58:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29898 states, 29897 states have (on average 1.4018463390975684) internal successors, (41911), 29897 states have internal predecessors, (41911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29898 states to 29898 states and 41911 transitions. [2024-10-14 03:58:14,513 INFO L78 Accepts]: Start accepts. Automaton has 29898 states and 41911 transitions. Word has length 117 [2024-10-14 03:58:14,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:14,514 INFO L471 AbstractCegarLoop]: Abstraction has 29898 states and 41911 transitions. [2024-10-14 03:58:14,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 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-14 03:58:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 29898 states and 41911 transitions. [2024-10-14 03:58:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:58:14,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:14,515 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-14 03:58:14,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-10-14 03:58:14,515 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:14,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 516056448, now seen corresponding path program 1 times [2024-10-14 03:58:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:14,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447087122] [2024-10-14 03:58:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:14,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:14,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447087122] [2024-10-14 03:58:14,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447087122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:14,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:14,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:58:14,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55820285] [2024-10-14 03:58:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:14,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:58:14,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:14,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:58:14,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:58:14,679 INFO L87 Difference]: Start difference. First operand 29898 states and 41911 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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-14 03:58:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:14,748 INFO L93 Difference]: Finished difference Result 30860 states and 43192 transitions. [2024-10-14 03:58:14,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:58:14,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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-14 03:58:14,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:14,777 INFO L225 Difference]: With dead ends: 30860 [2024-10-14 03:58:14,777 INFO L226 Difference]: Without dead ends: 30858 [2024-10-14 03:58:14,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:58:14,785 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 0 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:14,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 927 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:14,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30858 states. [2024-10-14 03:58:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30858 to 30858. [2024-10-14 03:58:15,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30858 states, 30857 states have (on average 1.3831221440840005) internal successors, (42679), 30857 states have internal predecessors, (42679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30858 states to 30858 states and 42679 transitions. [2024-10-14 03:58:15,179 INFO L78 Accepts]: Start accepts. Automaton has 30858 states and 42679 transitions. Word has length 118 [2024-10-14 03:58:15,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:15,180 INFO L471 AbstractCegarLoop]: Abstraction has 30858 states and 42679 transitions. [2024-10-14 03:58:15,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 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-14 03:58:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30858 states and 42679 transitions. [2024-10-14 03:58:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 03:58:15,180 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:15,181 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-14 03:58:15,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-10-14 03:58:15,181 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:15,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:15,181 INFO L85 PathProgramCache]: Analyzing trace with hash 856768381, now seen corresponding path program 1 times [2024-10-14 03:58:15,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:15,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034498226] [2024-10-14 03:58:15,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:15,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:15,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:15,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:15,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034498226] [2024-10-14 03:58:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034498226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:58:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541716294] [2024-10-14 03:58:15,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:15,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:58:15,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:58:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:58:15,277 INFO L87 Difference]: Start difference. First operand 30858 states and 42679 transitions. Second operand has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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-14 03:58:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:15,569 INFO L93 Difference]: Finished difference Result 58870 states and 81725 transitions. [2024-10-14 03:58:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:58:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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-14 03:58:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:15,628 INFO L225 Difference]: With dead ends: 58870 [2024-10-14 03:58:15,628 INFO L226 Difference]: Without dead ends: 53268 [2024-10-14 03:58:15,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:58:15,647 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 1190 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:15,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 1106 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:15,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53268 states. [2024-10-14 03:58:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53268 to 36458. [2024-10-14 03:58:16,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36458 states, 36457 states have (on average 1.3830814384068904) internal successors, (50423), 36457 states have internal predecessors, (50423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:16,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36458 states to 36458 states and 50423 transitions. [2024-10-14 03:58:16,288 INFO L78 Accepts]: Start accepts. Automaton has 36458 states and 50423 transitions. Word has length 118 [2024-10-14 03:58:16,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:16,288 INFO L471 AbstractCegarLoop]: Abstraction has 36458 states and 50423 transitions. [2024-10-14 03:58:16,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.857142857142858) internal successors, (118), 7 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-14 03:58:16,288 INFO L276 IsEmpty]: Start isEmpty. Operand 36458 states and 50423 transitions. [2024-10-14 03:58:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 03:58:16,289 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:16,289 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-14 03:58:16,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-10-14 03:58:16,289 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:16,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:16,290 INFO L85 PathProgramCache]: Analyzing trace with hash -193914565, now seen corresponding path program 1 times [2024-10-14 03:58:16,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:16,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610695850] [2024-10-14 03:58:16,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:16,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:16,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610695850] [2024-10-14 03:58:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610695850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:16,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408821713] [2024-10-14 03:58:16,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:16,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:16,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:16,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:16,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:16,366 INFO L87 Difference]: Start difference. First operand 36458 states and 50423 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:16,509 INFO L93 Difference]: Finished difference Result 94542 states and 130553 transitions. [2024-10-14 03:58:16,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119 [2024-10-14 03:58:16,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:16,573 INFO L225 Difference]: With dead ends: 94542 [2024-10-14 03:58:16,573 INFO L226 Difference]: Without dead ends: 58220 [2024-10-14 03:58:16,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:16,608 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 94 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:16,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 410 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:16,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58220 states. [2024-10-14 03:58:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58220 to 54890. [2024-10-14 03:58:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54890 states, 54889 states have (on average 1.3640437974821913) internal successors, (74871), 54889 states have internal predecessors, (74871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:17,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54890 states to 54890 states and 74871 transitions. [2024-10-14 03:58:17,384 INFO L78 Accepts]: Start accepts. Automaton has 54890 states and 74871 transitions. Word has length 119 [2024-10-14 03:58:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 54890 states and 74871 transitions. [2024-10-14 03:58:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 54890 states and 74871 transitions. [2024-10-14 03:58:17,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 03:58:17,390 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:17,390 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:17,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-10-14 03:58:17,391 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1196105168, now seen corresponding path program 1 times [2024-10-14 03:58:17,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845623087] [2024-10-14 03:58:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:17,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:17,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:17,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845623087] [2024-10-14 03:58:17,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845623087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:58:17,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:58:17,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 03:58:17,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103760184] [2024-10-14 03:58:17,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:58:17,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:58:17,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:17,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:58:17,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:17,464 INFO L87 Difference]: Start difference. First operand 54890 states and 74871 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:17,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:17,660 INFO L93 Difference]: Finished difference Result 109646 states and 149593 transitions. [2024-10-14 03:58:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:58:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2024-10-14 03:58:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:17,892 INFO L225 Difference]: With dead ends: 109646 [2024-10-14 03:58:17,892 INFO L226 Difference]: Without dead ends: 54892 [2024-10-14 03:58:17,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 03:58:17,950 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 82 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:17,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 380 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 03:58:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54892 states. [2024-10-14 03:58:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54892 to 54890. [2024-10-14 03:58:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54890 states, 54889 states have (on average 1.3488859334292846) internal successors, (74039), 54889 states have internal predecessors, (74039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54890 states to 54890 states and 74039 transitions. [2024-10-14 03:58:18,603 INFO L78 Accepts]: Start accepts. Automaton has 54890 states and 74039 transitions. Word has length 149 [2024-10-14 03:58:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:18,604 INFO L471 AbstractCegarLoop]: Abstraction has 54890 states and 74039 transitions. [2024-10-14 03:58:18,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 54890 states and 74039 transitions. [2024-10-14 03:58:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 03:58:18,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:18,609 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:18,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-10-14 03:58:18,609 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:18,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:18,610 INFO L85 PathProgramCache]: Analyzing trace with hash 482313619, now seen corresponding path program 1 times [2024-10-14 03:58:18,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:18,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743900144] [2024-10-14 03:58:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:18,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:18,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:18,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743900144] [2024-10-14 03:58:18,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743900144] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:58:18,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918974962] [2024-10-14 03:58:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:18,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:58:18,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:58:18,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:58:18,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 03:58:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:19,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 03:58:19,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:58:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:19,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:58:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918974962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:58:21,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:58:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-10-14 03:58:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84461845] [2024-10-14 03:58:21,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:58:21,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 03:58:21,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:21,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 03:58:21,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2024-10-14 03:58:21,391 INFO L87 Difference]: Start difference. First operand 54890 states and 74039 transitions. Second operand has 25 states, 25 states have (on average 15.16) internal successors, (379), 24 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:23,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:23,144 INFO L93 Difference]: Finished difference Result 273714 states and 366906 transitions. [2024-10-14 03:58:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-14 03:58:23,145 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 15.16) internal successors, (379), 24 states have internal predecessors, (379), 0 states have call successors, (0), 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 149 [2024-10-14 03:58:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:23,369 INFO L225 Difference]: With dead ends: 273714 [2024-10-14 03:58:23,369 INFO L226 Difference]: Without dead ends: 218960 [2024-10-14 03:58:23,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=810, Invalid=2850, Unknown=0, NotChecked=0, Total=3660 [2024-10-14 03:58:23,452 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 2975 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 1554 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2975 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:23,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2975 Valid, 1585 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1554 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:58:23,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218960 states. [2024-10-14 03:58:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218960 to 115960. [2024-10-14 03:58:25,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115960 states, 115959 states have (on average 1.3401029674281426) internal successors, (155397), 115959 states have internal predecessors, (155397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115960 states to 115960 states and 155397 transitions. [2024-10-14 03:58:25,415 INFO L78 Accepts]: Start accepts. Automaton has 115960 states and 155397 transitions. Word has length 149 [2024-10-14 03:58:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:25,415 INFO L471 AbstractCegarLoop]: Abstraction has 115960 states and 155397 transitions. [2024-10-14 03:58:25,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 15.16) internal successors, (379), 24 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 115960 states and 155397 transitions. [2024-10-14 03:58:25,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:58:25,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:25,423 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:25,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 03:58:25,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2024-10-14 03:58:25,624 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:25,625 INFO L85 PathProgramCache]: Analyzing trace with hash 672718090, now seen corresponding path program 1 times [2024-10-14 03:58:25,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:25,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763949221] [2024-10-14 03:58:25,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:25,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:26,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:26,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763949221] [2024-10-14 03:58:26,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763949221] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:58:26,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757109562] [2024-10-14 03:58:26,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:26,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:58:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:58:26,275 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:58:26,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 03:58:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:26,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-14 03:58:26,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:58:27,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:27,211 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:58:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:28,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757109562] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:58:28,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:58:28,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2024-10-14 03:58:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050924352] [2024-10-14 03:58:28,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:58:28,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-14 03:58:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:28,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-14 03:58:28,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2024-10-14 03:58:28,533 INFO L87 Difference]: Start difference. First operand 115960 states and 155397 transitions. Second operand has 29 states, 29 states have (on average 13.206896551724139) internal successors, (383), 28 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:30,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:58:30,252 INFO L93 Difference]: Finished difference Result 461282 states and 621122 transitions. [2024-10-14 03:58:30,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 03:58:30,253 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 13.206896551724139) internal successors, (383), 28 states have internal predecessors, (383), 0 states have call successors, (0), 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 150 [2024-10-14 03:58:30,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:58:30,627 INFO L225 Difference]: With dead ends: 461282 [2024-10-14 03:58:30,627 INFO L226 Difference]: Without dead ends: 345472 [2024-10-14 03:58:30,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2024-10-14 03:58:30,705 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1888 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 1639 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:58:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 1639 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 03:58:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345472 states. [2024-10-14 03:58:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345472 to 273876. [2024-10-14 03:58:33,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273876 states, 273875 states have (on average 1.337628480146052) internal successors, (366343), 273875 states have internal predecessors, (366343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273876 states to 273876 states and 366343 transitions. [2024-10-14 03:58:34,916 INFO L78 Accepts]: Start accepts. Automaton has 273876 states and 366343 transitions. Word has length 150 [2024-10-14 03:58:34,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:58:34,916 INFO L471 AbstractCegarLoop]: Abstraction has 273876 states and 366343 transitions. [2024-10-14 03:58:34,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 13.206896551724139) internal successors, (383), 28 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 03:58:34,916 INFO L276 IsEmpty]: Start isEmpty. Operand 273876 states and 366343 transitions. [2024-10-14 03:58:34,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 03:58:34,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:58:34,930 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 03:58:34,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 03:58:35,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2024-10-14 03:58:35,131 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 13 more)] === [2024-10-14 03:58:35,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:58:35,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1191295030, now seen corresponding path program 1 times [2024-10-14 03:58:35,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:58:35,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954000799] [2024-10-14 03:58:35,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:35,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:58:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:35,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:58:35,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954000799] [2024-10-14 03:58:35,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954000799] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:58:35,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052104600] [2024-10-14 03:58:35,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:58:35,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:58:35,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:58:35,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 03:58:35,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 03:58:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:58:36,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 03:58:36,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:58:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:36,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 03:58:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:58:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052104600] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 03:58:36,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 03:58:36,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 28 [2024-10-14 03:58:36,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812054868] [2024-10-14 03:58:36,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 03:58:36,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 03:58:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:58:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 03:58:36,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2024-10-14 03:58:36,945 INFO L87 Difference]: Start difference. First operand 273876 states and 366343 transitions. Second operand has 28 states, 28 states have (on average 14.464285714285714) internal successors, (405), 28 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)