./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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 72fb41a66cb1f9b8ef6e2c9a867b06ff465ce26afd613e6d36809476f178395e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 03:50:05,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:50:05,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:50:05,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:50:05,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:50:05,122 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:50:05,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:50:05,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:50:05,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:50:05,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:50:05,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:50:05,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:50:05,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:50:05,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:50:05,125 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:50:05,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:50:05,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:50:05,126 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:50:05,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:50:05,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:50:05,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:50:05,135 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:50:05,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:50:05,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:50:05,136 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:50:05,136 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:50:05,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:50:05,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:50:05,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:50:05,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:50:05,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:50:05,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:50:05,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:50:05,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:50:05,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:50:05,138 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:50:05,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:50:05,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:50:05,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:50:05,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:50:05,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:50:05,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:50:05,140 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-clean/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-clean/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 -> 72fb41a66cb1f9b8ef6e2c9a867b06ff465ce26afd613e6d36809476f178395e [2024-10-11 03:50:05,367 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:50:05,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:50:05,395 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:50:05,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:50:05,399 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:50:05,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:50:06,813 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:50:07,216 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:50:07,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:50:07,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ef684cc3/05de0800ae9946a68b8b9b2259b40995/FLAG03ffc4043 [2024-10-11 03:50:07,269 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3ef684cc3/05de0800ae9946a68b8b9b2259b40995 [2024-10-11 03:50:07,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:50:07,274 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:50:07,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:50:07,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:50:07,283 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:50:07,284 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:50:07" (1/1) ... [2024-10-11 03:50:07,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@208f7cf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:07, skipping insertion in model container [2024-10-11 03:50:07,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:50:07" (1/1) ... [2024-10-11 03:50:07,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:50:07,815 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13533,13546] [2024-10-11 03:50:07,857 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18033,18046] [2024-10-11 03:50:07,866 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19325,19338] [2024-10-11 03:50:07,871 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20083,20096] [2024-10-11 03:50:07,880 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21703,21716] [2024-10-11 03:50:07,885 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22461,22474] [2024-10-11 03:50:07,892 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23547,23560] [2024-10-11 03:50:07,904 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26086,26099] [2024-10-11 03:50:07,913 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26847,26860] [2024-10-11 03:50:07,925 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27936,27949] [2024-10-11 03:50:07,935 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29941,29954] [2024-10-11 03:50:07,969 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33864,33877] [2024-10-11 03:50:07,979 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34625,34638] [2024-10-11 03:50:07,995 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35718,35731] [2024-10-11 03:50:08,013 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37727,37740] [2024-10-11 03:50:08,039 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41330,41343] [2024-10-11 03:50:08,081 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48207,48220] [2024-10-11 03:50:08,087 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48968,48981] [2024-10-11 03:50:08,100 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50057,50070] [2024-10-11 03:50:08,110 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52062,52075] [2024-10-11 03:50:08,127 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55451,55464] [2024-10-11 03:50:08,147 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61148,61161] [2024-10-11 03:50:08,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:50:08,498 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:50:08,566 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[13533,13546] [2024-10-11 03:50:08,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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[18033,18046] [2024-10-11 03:50:08,596 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[19325,19338] [2024-10-11 03:50:08,603 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[20083,20096] [2024-10-11 03:50:08,613 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[21703,21716] [2024-10-11 03:50:08,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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[22461,22474] [2024-10-11 03:50:08,622 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[23547,23560] [2024-10-11 03:50:08,630 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26086,26099] [2024-10-11 03:50:08,633 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[26847,26860] [2024-10-11 03:50:08,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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[27936,27949] [2024-10-11 03:50:08,644 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[29941,29954] [2024-10-11 03:50:08,656 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[33864,33877] [2024-10-11 03:50:08,660 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[34625,34638] [2024-10-11 03:50:08,664 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[35718,35731] [2024-10-11 03:50:08,671 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[37727,37740] [2024-10-11 03:50:08,683 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[41330,41343] [2024-10-11 03:50:08,709 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48207,48220] [2024-10-11 03:50:08,712 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[48968,48981] [2024-10-11 03:50:08,717 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[50057,50070] [2024-10-11 03:50:08,723 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[52062,52075] [2024-10-11 03:50:08,733 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[55451,55464] [2024-10-11 03:50:08,754 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.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c[61148,61161] [2024-10-11 03:50:08,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:50:08,975 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:50:08,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08 WrapperNode [2024-10-11 03:50:08,976 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:50:08,977 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:50:08,977 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:50:08,977 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:50:08,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,210 INFO L138 Inliner]: procedures = 26, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 6750 [2024-10-11 03:50:09,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:50:09,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:50:09,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:50:09,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:50:09,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,224 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,297 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-11 03:50:09,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:50:09,446 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:50:09,446 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:50:09,446 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:50:09,447 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (1/1) ... [2024-10-11 03:50:09,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:50:09,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:50:09,480 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:50:09,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:50:09,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:50:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:50:09,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:50:09,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:50:09,778 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:50:09,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:50:13,010 INFO L? ?]: Removed 1001 outVars from TransFormulas that were not future-live. [2024-10-11 03:50:13,011 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:50:13,091 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:50:13,092 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:50:13,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:50:13 BoogieIcfgContainer [2024-10-11 03:50:13,092 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:50:13,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:50:13,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:50:13,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:50:13,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:50:07" (1/3) ... [2024-10-11 03:50:13,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b42f6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:50:13, skipping insertion in model container [2024-10-11 03:50:13,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:50:08" (2/3) ... [2024-10-11 03:50:13,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b42f6db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:50:13, skipping insertion in model container [2024-10-11 03:50:13,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:50:13" (3/3) ... [2024-10-11 03:50:13,102 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2024-10-11 03:50:13,118 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:50:13,118 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 03:50:13,227 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:50:13,233 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;@5fe14f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:50:13,234 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-11 03:50:13,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:13,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 03:50:13,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:13,280 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-11 03:50:13,280 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -744865271, now seen corresponding path program 1 times [2024-10-11 03:50:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:13,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745655495] [2024-10-11 03:50:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:13,959 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-11 03:50:13,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:13,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745655495] [2024-10-11 03:50:13,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745655495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:13,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958166496] [2024-10-11 03:50:13,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:13,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:13,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:13,998 INFO L87 Difference]: Start difference. First operand has 1122 states, 1099 states have (on average 1.8616924476797088) internal successors, (2046), 1121 states have internal predecessors, (2046), 0 states have call successors, (0), 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 16.8) internal successors, (84), 4 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-11 03:50:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:14,823 INFO L93 Difference]: Finished difference Result 1697 states and 2993 transitions. [2024-10-11 03:50:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:14,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 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-11 03:50:14,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:14,848 INFO L225 Difference]: With dead ends: 1697 [2024-10-11 03:50:14,848 INFO L226 Difference]: Without dead ends: 876 [2024-10-11 03:50:14,858 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-11 03:50:14,862 INFO L432 NwaCegarLoop]: 1016 mSDtfsCounter, 4497 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:14,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 1056 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-10-11 03:50:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 876. [2024-10-11 03:50:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 854 states have (on average 1.3185011709601873) internal successors, (1126), 875 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1126 transitions. [2024-10-11 03:50:14,942 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1126 transitions. Word has length 84 [2024-10-11 03:50:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:14,942 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1126 transitions. [2024-10-11 03:50:14,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 4 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-11 03:50:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1126 transitions. [2024-10-11 03:50:14,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:50:14,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:14,949 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-11 03:50:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:50:14,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:14,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash 861830130, now seen corresponding path program 1 times [2024-10-11 03:50:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679165391] [2024-10-11 03:50:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:15,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:15,176 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-11 03:50:15,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:15,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679165391] [2024-10-11 03:50:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679165391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:15,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630705279] [2024-10-11 03:50:15,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:15,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:15,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:15,180 INFO L87 Difference]: Start difference. First operand 876 states and 1126 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-11 03:50:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:15,833 INFO L93 Difference]: Finished difference Result 1445 states and 1914 transitions. [2024-10-11 03:50:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-11 03:50:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:15,840 INFO L225 Difference]: With dead ends: 1445 [2024-10-11 03:50:15,840 INFO L226 Difference]: Without dead ends: 796 [2024-10-11 03:50:15,841 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-11 03:50:15,845 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 2954 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2954 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:15,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2954 Valid, 523 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 03:50:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-11 03:50:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2024-10-11 03:50:15,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 774 states have (on average 1.3294573643410852) internal successors, (1029), 795 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1029 transitions. [2024-10-11 03:50:15,883 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1029 transitions. Word has length 85 [2024-10-11 03:50:15,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:15,884 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1029 transitions. [2024-10-11 03:50:15,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 4 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-11 03:50:15,885 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1029 transitions. [2024-10-11 03:50:15,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 03:50:15,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:15,888 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] [2024-10-11 03:50:15,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:50:15,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:15,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash 212889132, now seen corresponding path program 1 times [2024-10-11 03:50:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:15,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324243998] [2024-10-11 03:50:15,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:15,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:16,145 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-11 03:50:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324243998] [2024-10-11 03:50:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324243998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:16,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:16,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:16,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136090708] [2024-10-11 03:50:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:16,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:16,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:16,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:16,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:16,149 INFO L87 Difference]: Start difference. First operand 796 states and 1029 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:16,650 INFO L93 Difference]: Finished difference Result 1365 states and 1816 transitions. [2024-10-11 03:50:16,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:16,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2024-10-11 03:50:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:16,653 INFO L225 Difference]: With dead ends: 1365 [2024-10-11 03:50:16,654 INFO L226 Difference]: Without dead ends: 720 [2024-10-11 03:50:16,655 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-11 03:50:16,656 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 2743 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2743 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:16,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2743 Valid, 537 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:50:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2024-10-11 03:50:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 720. [2024-10-11 03:50:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 698 states have (on average 1.3524355300859598) internal successors, (944), 719 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 944 transitions. [2024-10-11 03:50:16,669 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 944 transitions. Word has length 86 [2024-10-11 03:50:16,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:16,670 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 944 transitions. [2024-10-11 03:50:16,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:16,670 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 944 transitions. [2024-10-11 03:50:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 03:50:16,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:16,672 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] [2024-10-11 03:50:16,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 03:50:16,672 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:16,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:16,673 INFO L85 PathProgramCache]: Analyzing trace with hash 595317579, now seen corresponding path program 1 times [2024-10-11 03:50:16,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827580929] [2024-10-11 03:50:16,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:16,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:16,867 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-11 03:50:16,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:16,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827580929] [2024-10-11 03:50:16,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827580929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:16,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:16,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:16,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725153451] [2024-10-11 03:50:16,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:16,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:16,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:16,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:16,872 INFO L87 Difference]: Start difference. First operand 720 states and 944 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:17,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:17,308 INFO L93 Difference]: Finished difference Result 1289 states and 1730 transitions. [2024-10-11 03:50:17,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:17,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-11 03:50:17,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:17,313 INFO L225 Difference]: With dead ends: 1289 [2024-10-11 03:50:17,314 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 03:50:17,315 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-11 03:50:17,317 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 2605 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2605 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:17,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2605 Valid, 509 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:50:17,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 03:50:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2024-10-11 03:50:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 648 states have (on average 1.3719135802469136) internal successors, (889), 669 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:17,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 889 transitions. [2024-10-11 03:50:17,335 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 889 transitions. Word has length 87 [2024-10-11 03:50:17,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:17,335 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 889 transitions. [2024-10-11 03:50:17,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 889 transitions. [2024-10-11 03:50:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 03:50:17,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:17,338 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] [2024-10-11 03:50:17,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 03:50:17,340 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:17,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:17,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1127238977, now seen corresponding path program 1 times [2024-10-11 03:50:17,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024871244] [2024-10-11 03:50:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:17,525 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-11 03:50:17,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:17,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024871244] [2024-10-11 03:50:17,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024871244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:17,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:17,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:17,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834179953] [2024-10-11 03:50:17,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:17,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:17,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:17,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:17,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:17,528 INFO L87 Difference]: Start difference. First operand 670 states and 889 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:18,248 INFO L93 Difference]: Finished difference Result 1585 states and 2142 transitions. [2024-10-11 03:50:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2024-10-11 03:50:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:18,253 INFO L225 Difference]: With dead ends: 1585 [2024-10-11 03:50:18,254 INFO L226 Difference]: Without dead ends: 988 [2024-10-11 03:50:18,256 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-11 03:50:18,258 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 3457 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3457 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:18,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3457 Valid, 754 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:18,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-11 03:50:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 908. [2024-10-11 03:50:18,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.4209932279909707) internal successors, (1259), 907 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1259 transitions. [2024-10-11 03:50:18,280 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1259 transitions. Word has length 88 [2024-10-11 03:50:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:18,280 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1259 transitions. [2024-10-11 03:50:18,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1259 transitions. [2024-10-11 03:50:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 03:50:18,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:18,283 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] [2024-10-11 03:50:18,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 03:50:18,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -81085098, now seen corresponding path program 1 times [2024-10-11 03:50:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125616937] [2024-10-11 03:50:18,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:18,479 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-11 03:50:18,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:18,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125616937] [2024-10-11 03:50:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125616937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:18,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:18,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 03:50:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24736637] [2024-10-11 03:50:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 03:50:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 03:50:18,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 03:50:18,482 INFO L87 Difference]: Start difference. First operand 908 states and 1259 transitions. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:18,946 INFO L93 Difference]: Finished difference Result 1743 states and 2444 transitions. [2024-10-11 03:50:18,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 03:50:18,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2024-10-11 03:50:18,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:18,950 INFO L225 Difference]: With dead ends: 1743 [2024-10-11 03:50:18,950 INFO L226 Difference]: Without dead ends: 900 [2024-10-11 03:50:18,952 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-11 03:50:18,954 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 2437 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2437 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:18,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2437 Valid, 469 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:50:18,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2024-10-11 03:50:18,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 900. [2024-10-11 03:50:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4214123006833712) internal successors, (1248), 899 states have internal predecessors, (1248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1248 transitions. [2024-10-11 03:50:18,976 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1248 transitions. Word has length 89 [2024-10-11 03:50:18,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:18,977 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1248 transitions. [2024-10-11 03:50:18,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1248 transitions. [2024-10-11 03:50:18,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:50:18,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:18,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 03:50:18,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:18,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1177000506, now seen corresponding path program 1 times [2024-10-11 03:50:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:18,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090523996] [2024-10-11 03:50:18,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:19,341 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-11 03:50:19,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:19,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090523996] [2024-10-11 03:50:19,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090523996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:19,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:19,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 03:50:19,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855764755] [2024-10-11 03:50:19,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:19,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:50:19,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:19,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:50:19,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:50:19,343 INFO L87 Difference]: Start difference. First operand 900 states and 1248 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:20,327 INFO L93 Difference]: Finished difference Result 1638 states and 2212 transitions. [2024-10-11 03:50:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:50:20,328 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:50:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:20,332 INFO L225 Difference]: With dead ends: 1638 [2024-10-11 03:50:20,332 INFO L226 Difference]: Without dead ends: 1221 [2024-10-11 03:50:20,333 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-11 03:50:20,334 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 2874 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2874 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 1528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:20,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2874 Valid, 1381 Invalid, 1528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2024-10-11 03:50:20,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 900. [2024-10-11 03:50:20,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4202733485193622) internal successors, (1247), 899 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:20,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1247 transitions. [2024-10-11 03:50:20,354 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1247 transitions. Word has length 90 [2024-10-11 03:50:20,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:20,354 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1247 transitions. [2024-10-11 03:50:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 6 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1247 transitions. [2024-10-11 03:50:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:50:20,356 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:20,356 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] [2024-10-11 03:50:20,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 03:50:20,356 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:20,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1435926047, now seen corresponding path program 1 times [2024-10-11 03:50:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:20,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919583708] [2024-10-11 03:50:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:20,868 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-11 03:50:20,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:20,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919583708] [2024-10-11 03:50:20,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919583708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:20,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:20,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986500350] [2024-10-11 03:50:20,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:20,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:20,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:20,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:20,871 INFO L87 Difference]: Start difference. First operand 900 states and 1247 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:22,266 INFO L93 Difference]: Finished difference Result 1587 states and 2212 transitions. [2024-10-11 03:50:22,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 03:50:22,266 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:50:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:22,272 INFO L225 Difference]: With dead ends: 1587 [2024-10-11 03:50:22,272 INFO L226 Difference]: Without dead ends: 1416 [2024-10-11 03:50:22,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-11 03:50:22,273 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 4397 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 2488 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:22,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 2488 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:50:22,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-10-11 03:50:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 907. [2024-10-11 03:50:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 907 states, 885 states have (on average 1.4203389830508475) internal successors, (1257), 906 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:22,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1257 transitions. [2024-10-11 03:50:22,297 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1257 transitions. Word has length 90 [2024-10-11 03:50:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:22,298 INFO L471 AbstractCegarLoop]: Abstraction has 907 states and 1257 transitions. [2024-10-11 03:50:22,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:22,298 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1257 transitions. [2024-10-11 03:50:22,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:50:22,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:22,300 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] [2024-10-11 03:50:22,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 03:50:22,300 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:22,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:22,301 INFO L85 PathProgramCache]: Analyzing trace with hash 546881237, now seen corresponding path program 1 times [2024-10-11 03:50:22,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:22,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380225181] [2024-10-11 03:50:22,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:22,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:22,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:22,651 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-11 03:50:22,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:22,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380225181] [2024-10-11 03:50:22,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380225181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599209479] [2024-10-11 03:50:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:22,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:22,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:22,654 INFO L87 Difference]: Start difference. First operand 907 states and 1257 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:23,514 INFO L93 Difference]: Finished difference Result 1242 states and 1742 transitions. [2024-10-11 03:50:23,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:23,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:50:23,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:23,521 INFO L225 Difference]: With dead ends: 1242 [2024-10-11 03:50:23,521 INFO L226 Difference]: Without dead ends: 978 [2024-10-11 03:50:23,522 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-11 03:50:23,524 INFO L432 NwaCegarLoop]: 720 mSDtfsCounter, 1453 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 2486 SdHoareTripleChecker+Invalid, 1644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:23,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 2486 Invalid, 1644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2024-10-11 03:50:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 900. [2024-10-11 03:50:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.419134396355353) internal successors, (1246), 899 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1246 transitions. [2024-10-11 03:50:23,544 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1246 transitions. Word has length 90 [2024-10-11 03:50:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:23,544 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1246 transitions. [2024-10-11 03:50:23,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1246 transitions. [2024-10-11 03:50:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 03:50:23,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:23,546 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] [2024-10-11 03:50:23,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 03:50:23,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:23,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:23,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1452291629, now seen corresponding path program 1 times [2024-10-11 03:50:23,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:23,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529231161] [2024-10-11 03:50:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:23,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:23,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:23,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529231161] [2024-10-11 03:50:23,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529231161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:23,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:23,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996610354] [2024-10-11 03:50:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:23,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:23,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:23,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:23,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:23,903 INFO L87 Difference]: Start difference. First operand 900 states and 1246 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:24,790 INFO L93 Difference]: Finished difference Result 1330 states and 1812 transitions. [2024-10-11 03:50:24,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:24,790 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2024-10-11 03:50:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:24,794 INFO L225 Difference]: With dead ends: 1330 [2024-10-11 03:50:24,794 INFO L226 Difference]: Without dead ends: 1325 [2024-10-11 03:50:24,795 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-11 03:50:24,796 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 3476 mSDsluCounter, 1421 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3476 SdHoareTripleChecker+Valid, 1866 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:24,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3476 Valid, 1866 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-11 03:50:24,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 900. [2024-10-11 03:50:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.417995444191344) internal successors, (1245), 899 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1245 transitions. [2024-10-11 03:50:24,813 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1245 transitions. Word has length 90 [2024-10-11 03:50:24,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:24,814 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1245 transitions. [2024-10-11 03:50:24,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 7 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1245 transitions. [2024-10-11 03:50:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:24,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:24,816 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] [2024-10-11 03:50:24,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 03:50:24,816 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:24,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:24,817 INFO L85 PathProgramCache]: Analyzing trace with hash 280311879, now seen corresponding path program 1 times [2024-10-11 03:50:24,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:24,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948831368] [2024-10-11 03:50:24,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:24,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:25,459 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-11 03:50:25,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:25,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948831368] [2024-10-11 03:50:25,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948831368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:25,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:25,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 03:50:25,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807883982] [2024-10-11 03:50:25,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:25,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 03:50:25,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:25,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 03:50:25,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 03:50:25,461 INFO L87 Difference]: Start difference. First operand 900 states and 1245 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:26,652 INFO L93 Difference]: Finished difference Result 1519 states and 2132 transitions. [2024-10-11 03:50:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 03:50:26,652 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:26,655 INFO L225 Difference]: With dead ends: 1519 [2024-10-11 03:50:26,655 INFO L226 Difference]: Without dead ends: 1119 [2024-10-11 03:50:26,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-10-11 03:50:26,656 INFO L432 NwaCegarLoop]: 509 mSDtfsCounter, 2657 mSDsluCounter, 2175 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2657 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 2179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:26,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2657 Valid, 2684 Invalid, 2179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:50:26,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-10-11 03:50:26,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 900. [2024-10-11 03:50:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4157175398633257) internal successors, (1243), 899 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1243 transitions. [2024-10-11 03:50:26,673 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1243 transitions. Word has length 92 [2024-10-11 03:50:26,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:26,673 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1243 transitions. [2024-10-11 03:50:26,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 9 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1243 transitions. [2024-10-11 03:50:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:26,675 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:26,675 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] [2024-10-11 03:50:26,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 03:50:26,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:26,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:26,676 INFO L85 PathProgramCache]: Analyzing trace with hash 347470600, now seen corresponding path program 1 times [2024-10-11 03:50:26,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:26,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211688683] [2024-10-11 03:50:26,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:26,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:27,003 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-11 03:50:27,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:27,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211688683] [2024-10-11 03:50:27,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211688683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:27,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:27,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:27,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684439043] [2024-10-11 03:50:27,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:27,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:27,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:27,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:27,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:27,005 INFO L87 Difference]: Start difference. First operand 900 states and 1243 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:27,876 INFO L93 Difference]: Finished difference Result 1537 states and 2131 transitions. [2024-10-11 03:50:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:27,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:27,880 INFO L225 Difference]: With dead ends: 1537 [2024-10-11 03:50:27,880 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 03:50:27,881 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-11 03:50:27,882 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 2227 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1633 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2227 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:27,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2227 Valid, 1993 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1633 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 03:50:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 900. [2024-10-11 03:50:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4134396355353076) internal successors, (1241), 899 states have internal predecessors, (1241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1241 transitions. [2024-10-11 03:50:27,899 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1241 transitions. Word has length 92 [2024-10-11 03:50:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1241 transitions. [2024-10-11 03:50:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1241 transitions. [2024-10-11 03:50:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:27,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:27,902 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] [2024-10-11 03:50:27,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 03:50:27,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:27,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash -950419438, now seen corresponding path program 1 times [2024-10-11 03:50:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:27,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474133713] [2024-10-11 03:50:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:28,226 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-11 03:50:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474133713] [2024-10-11 03:50:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474133713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593681380] [2024-10-11 03:50:28,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:28,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:28,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:28,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:28,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:28,228 INFO L87 Difference]: Start difference. First operand 900 states and 1241 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:29,583 INFO L93 Difference]: Finished difference Result 1669 states and 2329 transitions. [2024-10-11 03:50:29,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:29,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:29,588 INFO L225 Difference]: With dead ends: 1669 [2024-10-11 03:50:29,588 INFO L226 Difference]: Without dead ends: 1425 [2024-10-11 03:50:29,589 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-11 03:50:29,590 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 1723 mSDsluCounter, 2658 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 3574 SdHoareTripleChecker+Invalid, 2414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:29,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 3574 Invalid, 2414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:50:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-11 03:50:29,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 900. [2024-10-11 03:50:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4111617312072893) internal successors, (1239), 899 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1239 transitions. [2024-10-11 03:50:29,609 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1239 transitions. Word has length 92 [2024-10-11 03:50:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:29,609 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1239 transitions. [2024-10-11 03:50:29,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:29,610 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1239 transitions. [2024-10-11 03:50:29,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:29,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:29,611 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] [2024-10-11 03:50:29,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 03:50:29,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:29,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1340210149, now seen corresponding path program 1 times [2024-10-11 03:50:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049428404] [2024-10-11 03:50:29,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:29,911 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-11 03:50:29,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:29,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049428404] [2024-10-11 03:50:29,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049428404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:29,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:29,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:29,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496096665] [2024-10-11 03:50:29,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:29,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:29,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:29,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:29,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:29,913 INFO L87 Difference]: Start difference. First operand 900 states and 1239 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:30,936 INFO L93 Difference]: Finished difference Result 1476 states and 2025 transitions. [2024-10-11 03:50:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:30,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:30,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:30,940 INFO L225 Difference]: With dead ends: 1476 [2024-10-11 03:50:30,940 INFO L226 Difference]: Without dead ends: 1325 [2024-10-11 03:50:30,941 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-11 03:50:30,942 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 3428 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 1620 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3428 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:30,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3428 Valid, 1898 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1620 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-11 03:50:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 900. [2024-10-11 03:50:30,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4100227790432802) internal successors, (1238), 899 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1238 transitions. [2024-10-11 03:50:30,959 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1238 transitions. Word has length 92 [2024-10-11 03:50:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:30,959 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1238 transitions. [2024-10-11 03:50:30,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1238 transitions. [2024-10-11 03:50:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:30,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:30,961 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] [2024-10-11 03:50:30,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 03:50:30,962 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:30,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2065712337, now seen corresponding path program 1 times [2024-10-11 03:50:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601724250] [2024-10-11 03:50:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:31,320 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-11 03:50:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:31,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601724250] [2024-10-11 03:50:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601724250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690396678] [2024-10-11 03:50:31,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:31,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:31,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:31,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:31,322 INFO L87 Difference]: Start difference. First operand 900 states and 1238 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:32,722 INFO L93 Difference]: Finished difference Result 1635 states and 2276 transitions. [2024-10-11 03:50:32,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:32,726 INFO L225 Difference]: With dead ends: 1635 [2024-10-11 03:50:32,726 INFO L226 Difference]: Without dead ends: 1425 [2024-10-11 03:50:32,726 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-11 03:50:32,727 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 1720 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 2480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:32,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 3575 Invalid, 2480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 03:50:32,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-11 03:50:32,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 900. [2024-10-11 03:50:32,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4088838268792712) internal successors, (1237), 899 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:32,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1237 transitions. [2024-10-11 03:50:32,742 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1237 transitions. Word has length 92 [2024-10-11 03:50:32,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:32,742 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1237 transitions. [2024-10-11 03:50:32,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:32,743 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1237 transitions. [2024-10-11 03:50:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:32,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:32,744 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] [2024-10-11 03:50:32,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 03:50:32,745 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:32,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:32,745 INFO L85 PathProgramCache]: Analyzing trace with hash -806896861, now seen corresponding path program 1 times [2024-10-11 03:50:32,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:32,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088782228] [2024-10-11 03:50:32,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:32,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:33,140 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-11 03:50:33,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088782228] [2024-10-11 03:50:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088782228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:33,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373535667] [2024-10-11 03:50:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:33,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:33,142 INFO L87 Difference]: Start difference. First operand 900 states and 1237 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:34,281 INFO L93 Difference]: Finished difference Result 1620 states and 2258 transitions. [2024-10-11 03:50:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:34,285 INFO L225 Difference]: With dead ends: 1620 [2024-10-11 03:50:34,285 INFO L226 Difference]: Without dead ends: 1425 [2024-10-11 03:50:34,286 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-11 03:50:34,286 INFO L432 NwaCegarLoop]: 820 mSDtfsCounter, 2550 mSDsluCounter, 2772 mSDsCounter, 0 mSdLazyCounter, 2458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2550 SdHoareTripleChecker+Valid, 3592 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:34,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2550 Valid, 3592 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2458 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:50:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2024-10-11 03:50:34,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 900. [2024-10-11 03:50:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4077448747152619) internal successors, (1236), 899 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1236 transitions. [2024-10-11 03:50:34,300 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1236 transitions. Word has length 92 [2024-10-11 03:50:34,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:34,301 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1236 transitions. [2024-10-11 03:50:34,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1236 transitions. [2024-10-11 03:50:34,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 03:50:34,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:34,302 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] [2024-10-11 03:50:34,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 03:50:34,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:34,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:34,303 INFO L85 PathProgramCache]: Analyzing trace with hash -98755353, now seen corresponding path program 1 times [2024-10-11 03:50:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671853979] [2024-10-11 03:50:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:34,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:34,555 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-11 03:50:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671853979] [2024-10-11 03:50:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671853979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:34,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762912167] [2024-10-11 03:50:34,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:34,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:34,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:34,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:34,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:34,558 INFO L87 Difference]: Start difference. First operand 900 states and 1236 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:35,428 INFO L93 Difference]: Finished difference Result 1527 states and 2109 transitions. [2024-10-11 03:50:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:35,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2024-10-11 03:50:35,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:35,432 INFO L225 Difference]: With dead ends: 1527 [2024-10-11 03:50:35,432 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 03:50:35,433 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-11 03:50:35,433 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 3442 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3442 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 1618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:35,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3442 Valid, 1993 Invalid, 1618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 03:50:35,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 900. [2024-10-11 03:50:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4066059225512528) internal successors, (1235), 899 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1235 transitions. [2024-10-11 03:50:35,450 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1235 transitions. Word has length 92 [2024-10-11 03:50:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:35,450 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1235 transitions. [2024-10-11 03:50:35,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 7 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1235 transitions. [2024-10-11 03:50:35,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:35,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:35,453 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] [2024-10-11 03:50:35,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 03:50:35,453 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:35,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash 514536132, now seen corresponding path program 1 times [2024-10-11 03:50:35,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:35,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918050156] [2024-10-11 03:50:35,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:35,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:35,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:35,928 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-11 03:50:35,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918050156] [2024-10-11 03:50:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918050156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:35,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324538672] [2024-10-11 03:50:35,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:35,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:35,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:35,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:35,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:35,931 INFO L87 Difference]: Start difference. First operand 900 states and 1235 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:37,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:37,100 INFO L93 Difference]: Finished difference Result 1599 states and 2217 transitions. [2024-10-11 03:50:37,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:37,100 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:37,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:37,104 INFO L225 Difference]: With dead ends: 1599 [2024-10-11 03:50:37,104 INFO L226 Difference]: Without dead ends: 1397 [2024-10-11 03:50:37,105 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-11 03:50:37,105 INFO L432 NwaCegarLoop]: 696 mSDtfsCounter, 2555 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2555 SdHoareTripleChecker+Valid, 3186 SdHoareTripleChecker+Invalid, 2326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:37,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2555 Valid, 3186 Invalid, 2326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:50:37,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-10-11 03:50:37,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 900. [2024-10-11 03:50:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4043280182232347) internal successors, (1233), 899 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:37,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1233 transitions. [2024-10-11 03:50:37,118 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1233 transitions. Word has length 94 [2024-10-11 03:50:37,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:37,119 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1233 transitions. [2024-10-11 03:50:37,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:37,119 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1233 transitions. [2024-10-11 03:50:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:37,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:37,121 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] [2024-10-11 03:50:37,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 03:50:37,121 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:37,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:37,122 INFO L85 PathProgramCache]: Analyzing trace with hash 105690904, now seen corresponding path program 1 times [2024-10-11 03:50:37,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:37,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749817013] [2024-10-11 03:50:37,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:37,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:37,482 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-11 03:50:37,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:37,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749817013] [2024-10-11 03:50:37,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749817013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:37,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:37,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:37,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62393687] [2024-10-11 03:50:37,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:37,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:37,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:37,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:37,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:37,486 INFO L87 Difference]: Start difference. First operand 900 states and 1233 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:38,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:38,540 INFO L93 Difference]: Finished difference Result 1541 states and 2123 transitions. [2024-10-11 03:50:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:38,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:38,544 INFO L225 Difference]: With dead ends: 1541 [2024-10-11 03:50:38,544 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 03:50:38,544 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-11 03:50:38,545 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 2602 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2602 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 2010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:38,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2602 Valid, 2607 Invalid, 2010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 03:50:38,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 900. [2024-10-11 03:50:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.4020501138952164) internal successors, (1231), 899 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1231 transitions. [2024-10-11 03:50:38,556 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1231 transitions. Word has length 94 [2024-10-11 03:50:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:38,556 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1231 transitions. [2024-10-11 03:50:38,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:38,557 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1231 transitions. [2024-10-11 03:50:38,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:38,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:38,558 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] [2024-10-11 03:50:38,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 03:50:38,559 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:38,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:38,559 INFO L85 PathProgramCache]: Analyzing trace with hash 909968804, now seen corresponding path program 1 times [2024-10-11 03:50:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:38,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5900520] [2024-10-11 03:50:38,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:38,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:39,060 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-11 03:50:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:39,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5900520] [2024-10-11 03:50:39,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5900520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:39,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:39,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:39,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145295438] [2024-10-11 03:50:39,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:39,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:39,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:39,063 INFO L87 Difference]: Start difference. First operand 900 states and 1231 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:40,808 INFO L93 Difference]: Finished difference Result 2301 states and 3244 transitions. [2024-10-11 03:50:40,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:40,808 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:40,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:40,813 INFO L225 Difference]: With dead ends: 2301 [2024-10-11 03:50:40,813 INFO L226 Difference]: Without dead ends: 2025 [2024-10-11 03:50:40,813 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-11 03:50:40,814 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 5420 mSDsluCounter, 2848 mSDsCounter, 0 mSdLazyCounter, 2867 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5420 SdHoareTripleChecker+Valid, 3543 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 2867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:40,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5420 Valid, 3543 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 2867 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 03:50:40,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-10-11 03:50:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 908. [2024-10-11 03:50:40,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3984198645598194) internal successors, (1239), 907 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1239 transitions. [2024-10-11 03:50:40,830 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1239 transitions. Word has length 94 [2024-10-11 03:50:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:40,831 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1239 transitions. [2024-10-11 03:50:40,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1239 transitions. [2024-10-11 03:50:40,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:40,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:40,833 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] [2024-10-11 03:50:40,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 03:50:40,834 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:40,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:40,835 INFO L85 PathProgramCache]: Analyzing trace with hash -2106541419, now seen corresponding path program 1 times [2024-10-11 03:50:40,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:40,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918182379] [2024-10-11 03:50:40,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:40,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:41,123 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-11 03:50:41,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:41,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918182379] [2024-10-11 03:50:41,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918182379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:41,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:41,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:41,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527708897] [2024-10-11 03:50:41,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:41,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:41,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:41,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:41,127 INFO L87 Difference]: Start difference. First operand 908 states and 1239 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:41,986 INFO L93 Difference]: Finished difference Result 1483 states and 2023 transitions. [2024-10-11 03:50:41,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:41,987 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:41,991 INFO L225 Difference]: With dead ends: 1483 [2024-10-11 03:50:41,991 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:50:41,992 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-11 03:50:41,992 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 2229 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2229 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:41,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2229 Valid, 1957 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:41,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:50:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 908. [2024-10-11 03:50:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3961625282167043) internal successors, (1237), 907 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1237 transitions. [2024-10-11 03:50:42,006 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1237 transitions. Word has length 94 [2024-10-11 03:50:42,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:42,006 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1237 transitions. [2024-10-11 03:50:42,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:42,007 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1237 transitions. [2024-10-11 03:50:42,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:42,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:42,008 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] [2024-10-11 03:50:42,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 03:50:42,009 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:42,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:42,009 INFO L85 PathProgramCache]: Analyzing trace with hash 922822972, now seen corresponding path program 1 times [2024-10-11 03:50:42,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:42,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897826706] [2024-10-11 03:50:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:42,283 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-11 03:50:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897826706] [2024-10-11 03:50:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897826706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7633] [2024-10-11 03:50:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:42,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:42,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:42,286 INFO L87 Difference]: Start difference. First operand 908 states and 1237 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:43,287 INFO L93 Difference]: Finished difference Result 1595 states and 2201 transitions. [2024-10-11 03:50:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:43,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:43,292 INFO L225 Difference]: With dead ends: 1595 [2024-10-11 03:50:43,292 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:50:43,293 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-11 03:50:43,296 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 1940 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1940 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 2029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:43,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1940 Valid, 2571 Invalid, 2029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:43,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:50:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 908. [2024-10-11 03:50:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3939051918735892) internal successors, (1235), 907 states have internal predecessors, (1235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1235 transitions. [2024-10-11 03:50:43,312 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1235 transitions. Word has length 94 [2024-10-11 03:50:43,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:43,312 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1235 transitions. [2024-10-11 03:50:43,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:43,313 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1235 transitions. [2024-10-11 03:50:43,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:43,315 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:43,315 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] [2024-10-11 03:50:43,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 03:50:43,317 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:43,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 556568795, now seen corresponding path program 1 times [2024-10-11 03:50:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915538361] [2024-10-11 03:50:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:43,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:43,653 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-11 03:50:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915538361] [2024-10-11 03:50:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915538361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:43,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:43,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576765098] [2024-10-11 03:50:43,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:43,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:43,655 INFO L87 Difference]: Start difference. First operand 908 states and 1235 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:44,646 INFO L93 Difference]: Finished difference Result 1543 states and 2116 transitions. [2024-10-11 03:50:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:44,647 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:44,649 INFO L225 Difference]: With dead ends: 1543 [2024-10-11 03:50:44,650 INFO L226 Difference]: Without dead ends: 1381 [2024-10-11 03:50:44,650 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-11 03:50:44,651 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 2592 mSDsluCounter, 2157 mSDsCounter, 0 mSdLazyCounter, 2035 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2592 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 2039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:44,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2592 Valid, 2687 Invalid, 2039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2035 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-10-11 03:50:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 908. [2024-10-11 03:50:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.391647855530474) internal successors, (1233), 907 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1233 transitions. [2024-10-11 03:50:44,662 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1233 transitions. Word has length 94 [2024-10-11 03:50:44,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:44,662 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1233 transitions. [2024-10-11 03:50:44,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:44,663 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1233 transitions. [2024-10-11 03:50:44,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:44,664 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:44,664 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] [2024-10-11 03:50:44,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 03:50:44,664 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:44,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:44,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2039186161, now seen corresponding path program 1 times [2024-10-11 03:50:44,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:44,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266347791] [2024-10-11 03:50:44,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:44,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:44,903 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-11 03:50:44,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:44,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266347791] [2024-10-11 03:50:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266347791] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:44,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:44,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114618683] [2024-10-11 03:50:44,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:44,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:44,906 INFO L87 Difference]: Start difference. First operand 908 states and 1233 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:45,772 INFO L93 Difference]: Finished difference Result 1545 states and 2115 transitions. [2024-10-11 03:50:45,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:45,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:45,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:45,775 INFO L225 Difference]: With dead ends: 1545 [2024-10-11 03:50:45,775 INFO L226 Difference]: Without dead ends: 1381 [2024-10-11 03:50:45,776 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-11 03:50:45,776 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 3268 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3268 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:45,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3268 Valid, 2168 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:45,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-10-11 03:50:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 908. [2024-10-11 03:50:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.389390519187359) internal successors, (1231), 907 states have internal predecessors, (1231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1231 transitions. [2024-10-11 03:50:45,789 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1231 transitions. Word has length 94 [2024-10-11 03:50:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:45,789 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1231 transitions. [2024-10-11 03:50:45,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1231 transitions. [2024-10-11 03:50:45,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:45,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:45,791 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] [2024-10-11 03:50:45,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 03:50:45,792 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:45,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:45,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1846935907, now seen corresponding path program 1 times [2024-10-11 03:50:45,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:45,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094259614] [2024-10-11 03:50:45,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:45,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:50:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094259614] [2024-10-11 03:50:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094259614] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240543921] [2024-10-11 03:50:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:46,037 INFO L87 Difference]: Start difference. First operand 908 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:47,023 INFO L93 Difference]: Finished difference Result 1595 states and 2192 transitions. [2024-10-11 03:50:47,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:47,024 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:47,026 INFO L225 Difference]: With dead ends: 1595 [2024-10-11 03:50:47,026 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:50:47,026 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-11 03:50:47,027 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 1933 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 2015 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1933 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 2019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:47,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1933 Valid, 2556 Invalid, 2019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2015 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:50:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:50:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 908. [2024-10-11 03:50:47,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3871331828442437) internal successors, (1229), 907 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1229 transitions. [2024-10-11 03:50:47,039 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1229 transitions. Word has length 94 [2024-10-11 03:50:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:47,040 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1229 transitions. [2024-10-11 03:50:47,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1229 transitions. [2024-10-11 03:50:47,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:47,042 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:47,042 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] [2024-10-11 03:50:47,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 03:50:47,042 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:47,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1204221916, now seen corresponding path program 1 times [2024-10-11 03:50:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:47,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635809148] [2024-10-11 03:50:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:47,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:47,293 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-11 03:50:47,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635809148] [2024-10-11 03:50:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635809148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:47,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:47,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:47,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668274257] [2024-10-11 03:50:47,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:47,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:47,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:47,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:47,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:47,295 INFO L87 Difference]: Start difference. First operand 908 states and 1229 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:48,156 INFO L93 Difference]: Finished difference Result 1539 states and 2102 transitions. [2024-10-11 03:50:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:48,157 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:48,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:48,159 INFO L225 Difference]: With dead ends: 1539 [2024-10-11 03:50:48,159 INFO L226 Difference]: Without dead ends: 1381 [2024-10-11 03:50:48,160 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-11 03:50:48,160 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 2075 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2075 SdHoareTripleChecker+Valid, 2261 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:48,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2075 Valid, 2261 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:48,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-10-11 03:50:48,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 908. [2024-10-11 03:50:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3860045146726863) internal successors, (1228), 907 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:48,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1228 transitions. [2024-10-11 03:50:48,173 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1228 transitions. Word has length 94 [2024-10-11 03:50:48,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:48,173 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1228 transitions. [2024-10-11 03:50:48,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:48,173 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1228 transitions. [2024-10-11 03:50:48,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:48,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:48,175 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] [2024-10-11 03:50:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 03:50:48,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:48,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -470567483, now seen corresponding path program 1 times [2024-10-11 03:50:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068729496] [2024-10-11 03:50:48,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:48,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:48,467 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-11 03:50:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068729496] [2024-10-11 03:50:48,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068729496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:48,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:48,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:48,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369556560] [2024-10-11 03:50:48,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:48,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:48,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:48,470 INFO L87 Difference]: Start difference. First operand 908 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:49,489 INFO L93 Difference]: Finished difference Result 1576 states and 2163 transitions. [2024-10-11 03:50:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:49,491 INFO L225 Difference]: With dead ends: 1576 [2024-10-11 03:50:49,491 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:50:49,492 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-11 03:50:49,492 INFO L432 NwaCegarLoop]: 694 mSDtfsCounter, 2532 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:49,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 3184 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:50:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 908. [2024-10-11 03:50:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3848758465011286) internal successors, (1227), 907 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1227 transitions. [2024-10-11 03:50:49,506 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1227 transitions. Word has length 94 [2024-10-11 03:50:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:49,506 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1227 transitions. [2024-10-11 03:50:49,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1227 transitions. [2024-10-11 03:50:49,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:49,508 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:49,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:50:49,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 03:50:49,508 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:49,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:49,509 INFO L85 PathProgramCache]: Analyzing trace with hash -2102424565, now seen corresponding path program 1 times [2024-10-11 03:50:49,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:49,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282569271] [2024-10-11 03:50:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:49,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:49,805 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-11 03:50:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282569271] [2024-10-11 03:50:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282569271] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:49,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:49,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:49,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825299173] [2024-10-11 03:50:49,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:49,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:49,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:49,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:49,807 INFO L87 Difference]: Start difference. First operand 908 states and 1227 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:50,828 INFO L93 Difference]: Finished difference Result 1535 states and 2096 transitions. [2024-10-11 03:50:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:50,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:50,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:50,830 INFO L225 Difference]: With dead ends: 1535 [2024-10-11 03:50:50,831 INFO L226 Difference]: Without dead ends: 1381 [2024-10-11 03:50:50,831 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-11 03:50:50,831 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 2573 mSDsluCounter, 2286 mSDsCounter, 0 mSdLazyCounter, 2103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2573 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 2107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:50,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2573 Valid, 2884 Invalid, 2107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2103 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-10-11 03:50:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 908. [2024-10-11 03:50:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3837471783295712) internal successors, (1226), 907 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:50,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1226 transitions. [2024-10-11 03:50:50,842 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1226 transitions. Word has length 94 [2024-10-11 03:50:50,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:50,842 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1226 transitions. [2024-10-11 03:50:50,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1226 transitions. [2024-10-11 03:50:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:50,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:50,845 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] [2024-10-11 03:50:50,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 03:50:50,845 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:50,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:50,845 INFO L85 PathProgramCache]: Analyzing trace with hash -210482352, now seen corresponding path program 1 times [2024-10-11 03:50:50,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:50,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363244454] [2024-10-11 03:50:50,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:50,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:51,303 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-11 03:50:51,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:51,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363244454] [2024-10-11 03:50:51,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363244454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:51,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:50:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558233946] [2024-10-11 03:50:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:51,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:50:51,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:50:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:50:51,305 INFO L87 Difference]: Start difference. First operand 908 states and 1226 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:52,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:52,774 INFO L93 Difference]: Finished difference Result 2105 states and 2943 transitions. [2024-10-11 03:50:52,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:50:52,774 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:52,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:52,777 INFO L225 Difference]: With dead ends: 2105 [2024-10-11 03:50:52,777 INFO L226 Difference]: Without dead ends: 1925 [2024-10-11 03:50:52,779 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-11 03:50:52,779 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 5462 mSDsluCounter, 2348 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5462 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 2674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:52,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5462 Valid, 2992 Invalid, 2674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 03:50:52,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2024-10-11 03:50:52,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 912. [2024-10-11 03:50:52,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3820224719101124) internal successors, (1230), 911 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:52,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1230 transitions. [2024-10-11 03:50:52,792 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1230 transitions. Word has length 94 [2024-10-11 03:50:52,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:52,792 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1230 transitions. [2024-10-11 03:50:52,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 10 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:52,792 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1230 transitions. [2024-10-11 03:50:52,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:52,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:52,794 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] [2024-10-11 03:50:52,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 03:50:52,795 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:52,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:52,795 INFO L85 PathProgramCache]: Analyzing trace with hash -619327580, now seen corresponding path program 1 times [2024-10-11 03:50:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807356712] [2024-10-11 03:50:52,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:52,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:53,052 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-11 03:50:53,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:53,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807356712] [2024-10-11 03:50:53,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807356712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:53,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:53,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:53,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838399622] [2024-10-11 03:50:53,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:53,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:53,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:53,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:53,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:53,053 INFO L87 Difference]: Start difference. First operand 912 states and 1230 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:53,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:53,878 INFO L93 Difference]: Finished difference Result 1543 states and 2103 transitions. [2024-10-11 03:50:53,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:50:53,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:53,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:53,881 INFO L225 Difference]: With dead ends: 1543 [2024-10-11 03:50:53,881 INFO L226 Difference]: Without dead ends: 1385 [2024-10-11 03:50:53,881 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-11 03:50:53,882 INFO L432 NwaCegarLoop]: 547 mSDtfsCounter, 2032 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2032 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:53,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2032 Valid, 2340 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:50:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-11 03:50:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 912. [2024-10-11 03:50:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3808988764044945) internal successors, (1229), 911 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1229 transitions. [2024-10-11 03:50:53,894 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1229 transitions. Word has length 94 [2024-10-11 03:50:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:53,895 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1229 transitions. [2024-10-11 03:50:53,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1229 transitions. [2024-10-11 03:50:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:53,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:53,897 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] [2024-10-11 03:50:53,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 03:50:53,898 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:53,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:53,898 INFO L85 PathProgramCache]: Analyzing trace with hash 84458881, now seen corresponding path program 1 times [2024-10-11 03:50:53,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:53,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635960544] [2024-10-11 03:50:53,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:53,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:54,209 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-11 03:50:54,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:54,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635960544] [2024-10-11 03:50:54,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635960544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:54,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:54,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:54,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549433606] [2024-10-11 03:50:54,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:54,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:54,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:54,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:54,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:54,212 INFO L87 Difference]: Start difference. First operand 912 states and 1229 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:55,198 INFO L93 Difference]: Finished difference Result 1570 states and 2153 transitions. [2024-10-11 03:50:55,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:55,198 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:55,200 INFO L225 Difference]: With dead ends: 1570 [2024-10-11 03:50:55,200 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:50:55,201 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-11 03:50:55,201 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 2524 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2524 SdHoareTripleChecker+Valid, 3062 SdHoareTripleChecker+Invalid, 2210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:55,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2524 Valid, 3062 Invalid, 2210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2206 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:55,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:50:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 912. [2024-10-11 03:50:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3797752808988764) internal successors, (1228), 911 states have internal predecessors, (1228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1228 transitions. [2024-10-11 03:50:55,211 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1228 transitions. Word has length 94 [2024-10-11 03:50:55,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:55,211 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1228 transitions. [2024-10-11 03:50:55,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1228 transitions. [2024-10-11 03:50:55,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:55,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:55,213 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] [2024-10-11 03:50:55,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 03:50:55,213 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:55,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1723188937, now seen corresponding path program 1 times [2024-10-11 03:50:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:55,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995591891] [2024-10-11 03:50:55,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:55,477 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-11 03:50:55,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:55,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995591891] [2024-10-11 03:50:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995591891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:55,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:55,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004773607] [2024-10-11 03:50:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:55,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:55,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:55,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:55,481 INFO L87 Difference]: Start difference. First operand 912 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:56,510 INFO L93 Difference]: Finished difference Result 1537 states and 2095 transitions. [2024-10-11 03:50:56,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:56,510 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:56,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:56,512 INFO L225 Difference]: With dead ends: 1537 [2024-10-11 03:50:56,512 INFO L226 Difference]: Without dead ends: 1385 [2024-10-11 03:50:56,512 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-11 03:50:56,513 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 1760 mSDsluCounter, 2333 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 2957 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:56,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 2957 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:56,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-11 03:50:56,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 912. [2024-10-11 03:50:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3786516853932584) internal successors, (1227), 911 states have internal predecessors, (1227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:56,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1227 transitions. [2024-10-11 03:50:56,522 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1227 transitions. Word has length 94 [2024-10-11 03:50:56,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:56,522 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1227 transitions. [2024-10-11 03:50:56,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:56,522 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1227 transitions. [2024-10-11 03:50:56,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:56,523 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:56,523 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] [2024-10-11 03:50:56,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 03:50:56,524 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:56,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:56,524 INFO L85 PathProgramCache]: Analyzing trace with hash -431073860, now seen corresponding path program 1 times [2024-10-11 03:50:56,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959433055] [2024-10-11 03:50:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:56,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-11 03:50:56,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:56,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959433055] [2024-10-11 03:50:56,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959433055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:56,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:56,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:56,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599462716] [2024-10-11 03:50:56,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:56,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:56,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:56,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:56,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:56,772 INFO L87 Difference]: Start difference. First operand 912 states and 1227 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:57,690 INFO L93 Difference]: Finished difference Result 1576 states and 2156 transitions. [2024-10-11 03:50:57,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:50:57,690 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:57,693 INFO L225 Difference]: With dead ends: 1576 [2024-10-11 03:50:57,693 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:50:57,693 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-11 03:50:57,694 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 2830 mSDsluCounter, 2034 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 2100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:57,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2830 Valid, 2654 Invalid, 2100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:50:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:50:57,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 912. [2024-10-11 03:50:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3775280898876405) internal successors, (1226), 911 states have internal predecessors, (1226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:57,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1226 transitions. [2024-10-11 03:50:57,707 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1226 transitions. Word has length 94 [2024-10-11 03:50:57,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:57,707 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1226 transitions. [2024-10-11 03:50:57,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:57,707 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1226 transitions. [2024-10-11 03:50:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 03:50:57,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:57,709 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] [2024-10-11 03:50:57,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 03:50:57,709 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:57,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:57,710 INFO L85 PathProgramCache]: Analyzing trace with hash -2062930942, now seen corresponding path program 1 times [2024-10-11 03:50:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368432061] [2024-10-11 03:50:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:57,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:57,981 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-11 03:50:57,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:57,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368432061] [2024-10-11 03:50:57,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368432061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:57,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:57,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:57,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604726283] [2024-10-11 03:50:57,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:57,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:57,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:57,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:57,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:57,983 INFO L87 Difference]: Start difference. First operand 912 states and 1226 transitions. Second operand has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:58,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:50:58,966 INFO L93 Difference]: Finished difference Result 1539 states and 2095 transitions. [2024-10-11 03:50:58,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:50:58,967 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-11 03:50:58,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:50:58,968 INFO L225 Difference]: With dead ends: 1539 [2024-10-11 03:50:58,968 INFO L226 Difference]: Without dead ends: 1385 [2024-10-11 03:50:58,969 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-11 03:50:58,969 INFO L432 NwaCegarLoop]: 653 mSDtfsCounter, 2554 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 2171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 3032 SdHoareTripleChecker+Invalid, 2175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:50:58,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2554 Valid, 3032 Invalid, 2175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:50:58,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-10-11 03:50:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 912. [2024-10-11 03:50:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 890 states have (on average 1.3764044943820224) internal successors, (1225), 911 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1225 transitions. [2024-10-11 03:50:58,978 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1225 transitions. Word has length 94 [2024-10-11 03:50:58,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:50:58,979 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1225 transitions. [2024-10-11 03:50:58,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:50:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1225 transitions. [2024-10-11 03:50:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:50:58,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:50:58,980 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] [2024-10-11 03:50:58,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 03:50:58,981 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:50:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:50:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1598397179, now seen corresponding path program 1 times [2024-10-11 03:50:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:50:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964235630] [2024-10-11 03:50:58,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:50:58,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:50:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:50:59,242 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-11 03:50:59,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:50:59,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964235630] [2024-10-11 03:50:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964235630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:50:59,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:50:59,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:50:59,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463701118] [2024-10-11 03:50:59,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:50:59,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:50:59,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:50:59,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:50:59,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:50:59,245 INFO L87 Difference]: Start difference. First operand 912 states and 1225 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:00,299 INFO L93 Difference]: Finished difference Result 1709 states and 2336 transitions. [2024-10-11 03:51:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:00,300 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:00,302 INFO L225 Difference]: With dead ends: 1709 [2024-10-11 03:51:00,302 INFO L226 Difference]: Without dead ends: 1433 [2024-10-11 03:51:00,303 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-11 03:51:00,304 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 1696 mSDsluCounter, 2368 mSDsCounter, 0 mSdLazyCounter, 2311 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:00,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 3094 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-11 03:51:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 904. [2024-10-11 03:51:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 882 states have (on average 1.3775510204081634) internal successors, (1215), 903 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:00,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1215 transitions. [2024-10-11 03:51:00,318 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1215 transitions. Word has length 95 [2024-10-11 03:51:00,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:00,319 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1215 transitions. [2024-10-11 03:51:00,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1215 transitions. [2024-10-11 03:51:00,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 03:51:00,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:00,321 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:00,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 03:51:00,321 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:00,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:00,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1662722339, now seen corresponding path program 1 times [2024-10-11 03:51:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437518848] [2024-10-11 03:51:00,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:00,625 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-11 03:51:00,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:00,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437518848] [2024-10-11 03:51:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437518848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:00,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:00,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724133822] [2024-10-11 03:51:00,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:00,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:00,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:00,628 INFO L87 Difference]: Start difference. First operand 904 states and 1215 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:01,817 INFO L93 Difference]: Finished difference Result 1577 states and 2152 transitions. [2024-10-11 03:51:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2024-10-11 03:51:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:01,819 INFO L225 Difference]: With dead ends: 1577 [2024-10-11 03:51:01,819 INFO L226 Difference]: Without dead ends: 1397 [2024-10-11 03:51:01,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-11 03:51:01,820 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 1813 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1813 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:01,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1813 Valid, 2800 Invalid, 2103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:01,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-10-11 03:51:01,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 900. [2024-10-11 03:51:01,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.3781321184510251) internal successors, (1210), 899 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1210 transitions. [2024-10-11 03:51:01,834 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1210 transitions. Word has length 95 [2024-10-11 03:51:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:01,834 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1210 transitions. [2024-10-11 03:51:01,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1210 transitions. [2024-10-11 03:51:01,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:01,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:01,836 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] [2024-10-11 03:51:01,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 03:51:01,836 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:01,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:01,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1766740068, now seen corresponding path program 1 times [2024-10-11 03:51:01,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:01,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84443855] [2024-10-11 03:51:01,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:01,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:02,075 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-11 03:51:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84443855] [2024-10-11 03:51:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84443855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:02,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205767783] [2024-10-11 03:51:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:02,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:02,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:02,078 INFO L87 Difference]: Start difference. First operand 900 states and 1210 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:02,929 INFO L93 Difference]: Finished difference Result 1475 states and 1994 transitions. [2024-10-11 03:51:02,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:02,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:02,931 INFO L225 Difference]: With dead ends: 1475 [2024-10-11 03:51:02,931 INFO L226 Difference]: Without dead ends: 1325 [2024-10-11 03:51:02,932 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-11 03:51:02,932 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 2922 mSDsluCounter, 1767 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2922 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:02,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2922 Valid, 2327 Invalid, 1943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-11 03:51:02,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 900. [2024-10-11 03:51:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.3758542141230068) internal successors, (1208), 899 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1208 transitions. [2024-10-11 03:51:02,940 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1208 transitions. Word has length 96 [2024-10-11 03:51:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:02,940 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1208 transitions. [2024-10-11 03:51:02,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1208 transitions. [2024-10-11 03:51:02,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:02,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:02,942 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] [2024-10-11 03:51:02,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 03:51:02,942 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:02,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:02,942 INFO L85 PathProgramCache]: Analyzing trace with hash 500756844, now seen corresponding path program 1 times [2024-10-11 03:51:02,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:02,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697308430] [2024-10-11 03:51:02,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:02,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:03,187 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-11 03:51:03,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:03,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697308430] [2024-10-11 03:51:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697308430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:03,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062968730] [2024-10-11 03:51:03,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:03,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:03,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:03,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:03,189 INFO L87 Difference]: Start difference. First operand 900 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:03,976 INFO L93 Difference]: Finished difference Result 1479 states and 1997 transitions. [2024-10-11 03:51:03,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:03,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:03,979 INFO L225 Difference]: With dead ends: 1479 [2024-10-11 03:51:03,979 INFO L226 Difference]: Without dead ends: 1325 [2024-10-11 03:51:03,979 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-11 03:51:03,980 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 2599 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 1707 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2599 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:03,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2599 Valid, 2169 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1707 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-11 03:51:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 900. [2024-10-11 03:51:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.3735763097949887) internal successors, (1206), 899 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1206 transitions. [2024-10-11 03:51:03,994 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1206 transitions. Word has length 96 [2024-10-11 03:51:03,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:03,994 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1206 transitions. [2024-10-11 03:51:03,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:03,995 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1206 transitions. [2024-10-11 03:51:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:03,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:03,996 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] [2024-10-11 03:51:03,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 03:51:03,996 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:03,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:03,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1255893419, now seen corresponding path program 1 times [2024-10-11 03:51:03,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:03,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722718340] [2024-10-11 03:51:03,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:04,283 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-11 03:51:04,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:04,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722718340] [2024-10-11 03:51:04,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722718340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:04,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:04,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:04,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935196005] [2024-10-11 03:51:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:04,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:04,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:04,285 INFO L87 Difference]: Start difference. First operand 900 states and 1206 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:05,180 INFO L93 Difference]: Finished difference Result 1479 states and 1993 transitions. [2024-10-11 03:51:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:05,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:05,182 INFO L225 Difference]: With dead ends: 1479 [2024-10-11 03:51:05,182 INFO L226 Difference]: Without dead ends: 1325 [2024-10-11 03:51:05,182 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-11 03:51:05,183 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 2634 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 2002 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2634 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 2006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:05,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2634 Valid, 2625 Invalid, 2006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2002 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:05,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2024-10-11 03:51:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 900. [2024-10-11 03:51:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 900 states, 878 states have (on average 1.3712984054669703) internal successors, (1204), 899 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1204 transitions. [2024-10-11 03:51:05,195 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1204 transitions. Word has length 96 [2024-10-11 03:51:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:05,196 INFO L471 AbstractCegarLoop]: Abstraction has 900 states and 1204 transitions. [2024-10-11 03:51:05,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1204 transitions. [2024-10-11 03:51:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:05,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:05,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:51:05,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 03:51:05,198 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:05,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:05,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1126876775, now seen corresponding path program 1 times [2024-10-11 03:51:05,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:05,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736917603] [2024-10-11 03:51:05,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:05,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:05,615 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-11 03:51:05,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:05,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736917603] [2024-10-11 03:51:05,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736917603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:05,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:05,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:05,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564217515] [2024-10-11 03:51:05,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:05,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:05,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:05,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:05,618 INFO L87 Difference]: Start difference. First operand 900 states and 1204 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:07,032 INFO L93 Difference]: Finished difference Result 1983 states and 2742 transitions. [2024-10-11 03:51:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:51:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:07,034 INFO L225 Difference]: With dead ends: 1983 [2024-10-11 03:51:07,034 INFO L226 Difference]: Without dead ends: 1813 [2024-10-11 03:51:07,035 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-11 03:51:07,035 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 5909 mSDsluCounter, 2343 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5909 SdHoareTripleChecker+Valid, 2937 SdHoareTripleChecker+Invalid, 2527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:07,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5909 Valid, 2937 Invalid, 2527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 03:51:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-10-11 03:51:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 908. [2024-10-11 03:51:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3679458239277653) internal successors, (1212), 907 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1212 transitions. [2024-10-11 03:51:07,045 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1212 transitions. Word has length 96 [2024-10-11 03:51:07,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:07,045 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1212 transitions. [2024-10-11 03:51:07,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1212 transitions. [2024-10-11 03:51:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:07,046 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:07,046 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] [2024-10-11 03:51:07,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 03:51:07,047 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:07,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:07,047 INFO L85 PathProgramCache]: Analyzing trace with hash 443260260, now seen corresponding path program 1 times [2024-10-11 03:51:07,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:07,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642980508] [2024-10-11 03:51:07,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:07,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:07,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-11 03:51:07,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:07,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642980508] [2024-10-11 03:51:07,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642980508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:07,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:07,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:07,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437093930] [2024-10-11 03:51:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:07,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:07,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:07,288 INFO L87 Difference]: Start difference. First operand 908 states and 1212 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:08,180 INFO L93 Difference]: Finished difference Result 1487 states and 1999 transitions. [2024-10-11 03:51:08,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:08,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:08,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:08,182 INFO L225 Difference]: With dead ends: 1487 [2024-10-11 03:51:08,182 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:51:08,182 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-11 03:51:08,183 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 2631 mSDsluCounter, 2076 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2631 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:08,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2631 Valid, 2625 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:51:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 908. [2024-10-11 03:51:08,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3656884875846502) internal successors, (1210), 907 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1210 transitions. [2024-10-11 03:51:08,196 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1210 transitions. Word has length 96 [2024-10-11 03:51:08,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:08,196 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1210 transitions. [2024-10-11 03:51:08,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:08,196 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1210 transitions. [2024-10-11 03:51:08,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:08,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:08,198 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] [2024-10-11 03:51:08,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-11 03:51:08,198 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:08,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:08,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1939509934, now seen corresponding path program 1 times [2024-10-11 03:51:08,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:08,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811567850] [2024-10-11 03:51:08,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:08,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:08,385 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-11 03:51:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:08,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811567850] [2024-10-11 03:51:08,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811567850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:08,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:08,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:08,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245951483] [2024-10-11 03:51:08,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:08,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:08,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:08,387 INFO L87 Difference]: Start difference. First operand 908 states and 1210 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:09,233 INFO L93 Difference]: Finished difference Result 1543 states and 2086 transitions. [2024-10-11 03:51:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:09,233 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:09,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:09,235 INFO L225 Difference]: With dead ends: 1543 [2024-10-11 03:51:09,235 INFO L226 Difference]: Without dead ends: 1373 [2024-10-11 03:51:09,235 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-11 03:51:09,236 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 1920 mSDsluCounter, 1925 mSDsCounter, 0 mSdLazyCounter, 1900 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1920 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:09,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1920 Valid, 2516 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:09,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-10-11 03:51:09,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 908. [2024-10-11 03:51:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.363431151241535) internal successors, (1208), 907 states have internal predecessors, (1208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1208 transitions. [2024-10-11 03:51:09,247 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1208 transitions. Word has length 96 [2024-10-11 03:51:09,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:09,248 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1208 transitions. [2024-10-11 03:51:09,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:09,248 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1208 transitions. [2024-10-11 03:51:09,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:09,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:09,249 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] [2024-10-11 03:51:09,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-11 03:51:09,250 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:09,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:09,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1544761606, now seen corresponding path program 1 times [2024-10-11 03:51:09,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:09,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864326328] [2024-10-11 03:51:09,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:09,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:09,472 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-11 03:51:09,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:09,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864326328] [2024-10-11 03:51:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864326328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:09,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:09,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:09,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698833576] [2024-10-11 03:51:09,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:09,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:09,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:09,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:09,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:09,475 INFO L87 Difference]: Start difference. First operand 908 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:10,352 INFO L93 Difference]: Finished difference Result 1615 states and 2184 transitions. [2024-10-11 03:51:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:51:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:10,355 INFO L225 Difference]: With dead ends: 1615 [2024-10-11 03:51:10,355 INFO L226 Difference]: Without dead ends: 1405 [2024-10-11 03:51:10,355 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-11 03:51:10,356 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 1801 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1801 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:10,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1801 Valid, 2800 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-10-11 03:51:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 908. [2024-10-11 03:51:10,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3611738148984198) internal successors, (1206), 907 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1206 transitions. [2024-10-11 03:51:10,367 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1206 transitions. Word has length 96 [2024-10-11 03:51:10,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:10,367 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1206 transitions. [2024-10-11 03:51:10,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1206 transitions. [2024-10-11 03:51:10,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:10,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:10,369 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] [2024-10-11 03:51:10,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-11 03:51:10,369 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:10,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:10,370 INFO L85 PathProgramCache]: Analyzing trace with hash -52113932, now seen corresponding path program 1 times [2024-10-11 03:51:10,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380039429] [2024-10-11 03:51:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:10,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:10,599 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-11 03:51:10,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380039429] [2024-10-11 03:51:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380039429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576211069] [2024-10-11 03:51:10,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:10,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:10,601 INFO L87 Difference]: Start difference. First operand 908 states and 1206 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:11,439 INFO L93 Difference]: Finished difference Result 1479 states and 1984 transitions. [2024-10-11 03:51:11,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 03:51:11,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:11,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:11,441 INFO L225 Difference]: With dead ends: 1479 [2024-10-11 03:51:11,441 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:51:11,441 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-11 03:51:11,442 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 1959 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1959 SdHoareTripleChecker+Valid, 2395 SdHoareTripleChecker+Invalid, 1939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:11,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1959 Valid, 2395 Invalid, 1939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 03:51:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:51:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 908. [2024-10-11 03:51:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 886 states have (on average 1.3589164785553047) internal successors, (1204), 907 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1204 transitions. [2024-10-11 03:51:11,465 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1204 transitions. Word has length 96 [2024-10-11 03:51:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:11,465 INFO L471 AbstractCegarLoop]: Abstraction has 908 states and 1204 transitions. [2024-10-11 03:51:11,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1204 transitions. [2024-10-11 03:51:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:11,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:11,466 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] [2024-10-11 03:51:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-11 03:51:11,466 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:11,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:11,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1952926503, now seen corresponding path program 1 times [2024-10-11 03:51:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151800968] [2024-10-11 03:51:11,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:11,806 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-11 03:51:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151800968] [2024-10-11 03:51:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151800968] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:11,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:11,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:11,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687864276] [2024-10-11 03:51:11,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:11,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:11,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:11,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:11,808 INFO L87 Difference]: Start difference. First operand 908 states and 1204 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:13,128 INFO L93 Difference]: Finished difference Result 1843 states and 2518 transitions. [2024-10-11 03:51:13,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:51:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:13,131 INFO L225 Difference]: With dead ends: 1843 [2024-10-11 03:51:13,131 INFO L226 Difference]: Without dead ends: 1693 [2024-10-11 03:51:13,131 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-11 03:51:13,132 INFO L432 NwaCegarLoop]: 521 mSDtfsCounter, 6034 mSDsluCounter, 2243 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6034 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 2511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:13,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6034 Valid, 2764 Invalid, 2511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 03:51:13,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-10-11 03:51:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 916. [2024-10-11 03:51:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 894 states have (on average 1.3557046979865772) internal successors, (1212), 915 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1212 transitions. [2024-10-11 03:51:13,145 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1212 transitions. Word has length 96 [2024-10-11 03:51:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:13,146 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1212 transitions. [2024-10-11 03:51:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:13,146 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1212 transitions. [2024-10-11 03:51:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:13,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:13,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 03:51:13,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-11 03:51:13,148 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:13,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:13,149 INFO L85 PathProgramCache]: Analyzing trace with hash 427743812, now seen corresponding path program 1 times [2024-10-11 03:51:13,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:13,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631721491] [2024-10-11 03:51:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:13,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:13,559 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-11 03:51:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631721491] [2024-10-11 03:51:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631721491] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694343297] [2024-10-11 03:51:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:13,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:13,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:13,562 INFO L87 Difference]: Start difference. First operand 916 states and 1212 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:14,764 INFO L93 Difference]: Finished difference Result 1698 states and 2296 transitions. [2024-10-11 03:51:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 03:51:14,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:14,765 INFO L225 Difference]: With dead ends: 1698 [2024-10-11 03:51:14,766 INFO L226 Difference]: Without dead ends: 1693 [2024-10-11 03:51:14,766 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-11 03:51:14,766 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 6128 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 1843 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6128 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:14,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6128 Valid, 2268 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1843 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 03:51:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1693 states. [2024-10-11 03:51:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1693 to 924. [2024-10-11 03:51:14,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 902 states have (on average 1.352549889135255) internal successors, (1220), 923 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1220 transitions. [2024-10-11 03:51:14,776 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1220 transitions. Word has length 96 [2024-10-11 03:51:14,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:14,777 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1220 transitions. [2024-10-11 03:51:14,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1220 transitions. [2024-10-11 03:51:14,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:14,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:14,778 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] [2024-10-11 03:51:14,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-11 03:51:14,778 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash -375995292, now seen corresponding path program 1 times [2024-10-11 03:51:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:14,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200225340] [2024-10-11 03:51:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:14,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:14,987 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-11 03:51:14,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:14,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200225340] [2024-10-11 03:51:14,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200225340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:14,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:14,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:51:14,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477153447] [2024-10-11 03:51:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:14,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:51:14,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:51:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:51:14,989 INFO L87 Difference]: Start difference. First operand 924 states and 1220 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:51:15,864 INFO L93 Difference]: Finished difference Result 1338 states and 1762 transitions. [2024-10-11 03:51:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 03:51:15,864 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2024-10-11 03:51:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:51:15,865 INFO L225 Difference]: With dead ends: 1338 [2024-10-11 03:51:15,865 INFO L226 Difference]: Without dead ends: 1333 [2024-10-11 03:51:15,866 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-11 03:51:15,866 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 2616 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2616 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 03:51:15,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2616 Valid, 2661 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 03:51:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-11 03:51:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 924. [2024-10-11 03:51:15,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 924 states, 902 states have (on average 1.3503325942350333) internal successors, (1218), 923 states have internal predecessors, (1218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:15,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 924 states to 924 states and 1218 transitions. [2024-10-11 03:51:15,873 INFO L78 Accepts]: Start accepts. Automaton has 924 states and 1218 transitions. Word has length 96 [2024-10-11 03:51:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:51:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 924 states and 1218 transitions. [2024-10-11 03:51:15,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 7 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 03:51:15,874 INFO L276 IsEmpty]: Start isEmpty. Operand 924 states and 1218 transitions. [2024-10-11 03:51:15,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 03:51:15,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:51:15,875 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] [2024-10-11 03:51:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-11 03:51:15,875 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 19 more)] === [2024-10-11 03:51:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:51:15,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1536201810, now seen corresponding path program 1 times [2024-10-11 03:51:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:51:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373531332] [2024-10-11 03:51:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:51:15,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:51:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:51:16,237 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-11 03:51:16,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:51:16,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373531332] [2024-10-11 03:51:16,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373531332] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:51:16,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:51:16,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 03:51:16,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662825491] [2024-10-11 03:51:16,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:51:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 03:51:16,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:51:16,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 03:51:16,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-11 03:51:16,240 INFO L87 Difference]: Start difference. First operand 924 states and 1218 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 10 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)